## 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 given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Iterative Postorder traversal | Set 3
- LCA in a tree using Binary Lifting Technique
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Print all leaf nodes of a binary tree from right to left
- Create a mirror tree from the given binary tree
- K-th ancestor of a node in Binary Tree | Set 3
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Flatten Binary Tree in order of Level Order Traversal
- Find the largest Complete Subtree in a given Binary Tree
- Iterative approach to check for children sum property in a Binary Tree
- Count all k-sum paths in a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree
- Check if the given n-ary tree is a binary tree
- Kth node in Diagonal Traversal of Binary Tree
- Find the largest Perfect Subtree in a given Binary Tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Iterative approach to check if a Binary Tree is Perfect
- Reverse alternate levels of a perfect binary tree using Stack
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Get last node of the binary tree following given pattern starting from X
- Print all the nodes except the leftmost node in every level of the given binary tree
- Count nodes with two children at level L in a Binary Tree
- Maximum sum of leaf nodes among all levels of the given binary tree
- Find the sum of leafs at maximum level
- Recursive Program to Print extreme nodes of each level of Binary Tree in alternate order
- Reverse Clockwise spiral traversal of a binary tree
- Print even positioned nodes of even levels in level order of 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 »

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 »

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 »

Given a binary tree, the task is to print the sum of nodes in bottom view of the given Binary Tree. Bottom view of a… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. Examples: Input : 1 /… Read More »

Given a binary tree, the task is to print the nodes of the tree in a reverse anti-clockwise spiral manner. Examples: Input : 1 /… Read More »

Given a binary tree, the task is to print all leaf nodes of the given binary tree from left to right. That is, the nodes… Read More »

Given a binary tree and two nodes a and b, the task is to print the minimum and the maximum node value that lies in… Read More »

Given a Complete Binary Tree as an array, the task is to print all of its levels in sorted order. Examples: Input: arr[] = {7,… Read More »

Given a binary tree and two nodes, the task is to check if the nodes are siblings of each other or not. Two nodes are… Read More »

Given a binary tree in which each node element contains a number. The task is to find the minimum possible sum from one leaf node… Read More »

Given a Binary Tree having data at nodes as either 0’s or 1’s. The task is to find out whether there exists a subtree having… Read More »

Given a binary tree, the task is to count the number of Binary Search Trees present in it. Examples: Input: 1 / \ 2 3… Read More »

Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2… Read More »

Given a binary tree, the task is to print the reverse level order in spiral form. Examples: Input: 1 / \ 2 3 / \… Read More »