Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Tree911+ articles

Recursion591+ articles

interview-preparation348+ articles

Binary Tree330+ articles

tree-level-order123+ articles

tree-traversal88+ articles

Inorder Traversal43+ articles

PostOrder Traversal37+ articles

morris-traversal

7 posts

POTD Solutions | 22 Nov' 23 | Symmetric Tree

Last Updated: 23 July 2025

View all POTD SolutionsWelcome to the daily solutions of ourPROBLEM OF THE DAY (POTD). We will discuss the entire problem step-by-step and work towards developing an optim...read more

article_image

morris-traversal

GFG-POTD-Solutions

Count the number of Nodes in a Binary Tree in Constant Space

Last Updated: 23 July 2025

Given a binary tree having N nodes, count the number of nodes using constant O(1) space. This can be done by simple traversals like- Preorder, InOrder, PostOrder, and Leve...read more

article_image

Geeks Premier League

threaded-binary-tree

morris-traversal

Geeks Premier League 2023

Morris traversal for Postorder

Last Updated: 08 October 2025

Given the root of a binary tree, Find its postorder traversal using Morris Traversal, i.e., without using recursion or a stack.Examples:Input: Output: [4, 5, 2, 3, 1]...read more

article_image

PostOrder Traversal

morris-traversal

Elite-Batch-2022

Remove nodes from Binary Tree such that sum of all remaining root-to-leaf paths is atleast K

Last Updated: 23 July 2025

Given a Binary Tree and an integer k, the task is to delete nodes from the given Tree such that the sum of all nodes of all remaining root-to-leaf paths is at least k.Exam...read more

article_image

Preorder Traversal

PostOrder Traversal

Tree Traversals

morris-traversal

Level order traversal of Binary Tree using Morris Traversal

Last Updated: 15 July 2025

Given a binary tree, the task is to traverse the Binary Tree in level order fashion.Examples:Input: 1 / \ 2 3Output:12 3Input: 5 / \...read more

article_image

tree-level-order

morris-traversal

Print K inorder successors of a Binary Tree in O(1) space

Last Updated: 15 July 2025

Given a Binary Tree and two numbers P and K, the task is to print the K Inorder Successor of the given number P from the Binary tree in constant space.Examples:Input: Tree...read more

Inorder Traversal

morris-traversal

Post Order Traversal of Binary Tree in O(N) using O(1) space

Last Updated: 12 July 2025

Prerequisites:- Morris Inorder Traversal, Tree Traversals (Inorder, Preorder and Postorder)Given a Binary Tree, the task is to print the elements in post order using O(N) ...read more

article_image

Inorder Traversal

PostOrder Traversal

interview-preparation

morris-traversal