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

- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Reverse zigzag Traversal of a Binary Tree
- Reverse Level Order traversal in spiral form
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Iterative Postorder traversal | Set 3
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- LCA in a tree using Binary Lifting Technique
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Sum of all the Boundary Nodes of a Binary Tree
- Print all leaf nodes of a binary tree from right to left
- Sum of nodes in bottom view of Binary Tree
- Check if two nodes in a Binary Tree are siblings
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Distribute candies in a Binary Tree
- Create a mirror tree from the given binary tree
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- 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
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Minimum sum path between two leaves of a binary tree
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Print leaf nodes in binary tree from left to right using one stack
- Print the first shortest root to leaf path in a Binary Tree
- Iterative approach to check for children sum property in a Binary Tree
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree

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 »

Given a Binary Tree, the task is to print the leaf nodes from left to right. The nodes must be printed in the order they… Read More »

Given a Binary Tree, the task is to print the zigzag order of the tree. Examples: Input : 7 / \ 6 5 / /… Read More »

Given a binary tree and an integer K, the task is to remove all the nodes which are multiples of K from the given binary… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »

Given a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary tree, print all the leaf nodes of a Binary tree at a given level L. Examples: Input: 1 / \ 2 3… Read More »

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »