Iterative approach to check if a Binary Tree is Perfect
Given a Binary Tree, the task is to check whether the given Binary Tree is a perfect Binary Tree or not. A Binary tree is… Read More »
Category Archives: Tree
Kth node in Diagonal Traversal of Binary Tree
Given a binary tree and a value K. The task is to print the k-th node in the diagonal traversal of the binary tree. If… Read More »
Print all leaf nodes of a binary tree from right to left
Given a binary tree, the task is to print all the leaf nodes of the binary tree from right to left. Examples: Input : 1… Read More »
Reverse alternate levels of a perfect binary tree using Stack
Given a Perfect Binary Tree, the task is to reverse the alternate level nodes of the binary tree. Examples: Input: a / \ b c… Read More »
Recursive Program to Print extreme nodes of each level of Binary Tree in alternate order
Given a binary tree, the task is to print nodes of extreme corners of each level but in alternate order. Examples: Input : 1 /… Read More »
Iterative approach to check for children sum property in a Binary Tree
Given a binary tree, write a function that returns true if the tree satisfies below property: For every node, data value must be equal to… Read More »
Reverse Clockwise spiral traversal of a binary tree
Given a Binary Tree. The task is to print the circular reverse clockwise spiral order traversal of the given binary tree. Reverse Clockwise Traversal means… Read More »
Spanning Tree With Maximum Degree (Using Kruskal’s Algorithm)
Given an undirected unweighted connected graph consisting of n vertices and m edges. The task is to find any spanning tree of this graph such… Read More »
Count nodes with two children at level L in a Binary Tree
Given a Binary tree, the task is to count the number of nodes with two children at a given level L. Examples: Input: 1 /… Read More »
Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »
Construct Binary Tree from given Parent Array representation | Iterative Approach
Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent… Read More »
Create a mirror tree from the given binary tree
Given a binary tree, the task is to create a new binary tree which is a mirror image of the given binary tree. Examples: Input:… Read More »
Check if the given binary tree has a sub-tree with equal no of 1’s and 0’s | Set 2
Given a tree having every node’s value as either 0 or 1, the task is to find whether the given binary tree contains any sub-tree… Read More »
Largest sub-tree having equal no of 1’s and 0’s
Given a tree having every node’s value as either 0 or 1, the task is to find the maximum size of the sub-tree in the… Read More »
Remove minimum elements from either side such that 2*min becomes more than max | Set 2
Given an unsorted array, trim the array such that twice of minimum is greater than maximum in the trimmed array. Elements should be removed from… Read More »