Skip to content

Tag Archives: Inorder Traversal

Given two arrays pre[] and in[] representing the preorder and inorder traversal of the binary tree, the task is to check if the given traversals… Read More
Given a Binary Tree consisting of N nodes, the task is to first compress the tree diagonally to get a list of integers and then,… Read More
Given a Binary Tree consisting of N nodes, the task is to replace each node of the tree with the product of all the remaining… Read More
Given a Binary Search Tree (BST)consisting of N nodes and two nodes A and B, the task is to find the median of all the… Read More
The tree is a hierarchical Data Structure. A binary tree is a tree that has at most two children. The node which is on the… Read More
Given a binary tree, the task is to print the inorder traversal of the modified tree obtained after shifting all the nodes of the given… Read More
Given a binary tree, the task is to print all the nodes of the binary tree in Pre-order, Post-order, and In-order iteratively using only one… Read More
Given a Binary Tree, the task is to check if the given binary tree is a Binary Search Tree or not. If found to be… Read More
Given a Binary Tree, the task is to count the number of nodes in the Binary Tree, which are the highest valued node in the… Read More
Given a Binary Tree, the task for each level L is to print the Lth node of the tree. If the Lth node is not… Read More
Given a Binary Tree and an array arr[] consisting of values of nodes to be deleted, the task is to print Inorder Traversal of the… Read More
Given a Binary Tree consisting of N nodes, the task is to print its Mix Order Traversal.  Mix Order Traversal is a tree traversal technique,… Read More
Given a Binary Tree consisting of N nodes, the task is to print its Double Order Traversal. Double Order Traversal is a tree traversal technique… Read More
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
Given a binary tree consisting of N nodes, the task is to print the nodes that are just above the leaf node.Examples: Input: N =… Read More