## 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 »

## Sum of nodes in bottom view of Binary Tree

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 »

## Clockwise Spiral Traversal of Binary Tree | Set – 2

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 »

## Reverse Anti Clockwise Spiral Traversal of a Binary Tree

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 »

## Print leaf nodes in binary tree from left to right using one stack

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 »

## Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree

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 »

## Print Binary Tree levels in sorted order | Set 3 (Tree given as array)

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 »

## Check if two nodes in a Binary Tree are siblings

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 »

## Minimum sum path between two leaves of a binary tree

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 »

## Check if the given Binary Tree have a Subtree with equal no of 1’s and 0’s

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 »

## Count the Number of Binary Search Trees present in a Binary Tree

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 »

## Anti Clockwise spiral traversal of a binary tree

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 »

## Reverse Level Order traversal in spiral form

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