## Convert a given Binary Tree to Circular Doubly Linked List | Set 2

Given a Binary Tree, convert it to a Circular Doubly Linked List. The left and right pointers in nodes are to be used as previous… 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
- Clockwise Spiral Traversal of Binary Tree
- Reverse zigzag Traversal of a Binary Tree
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Iterative Boundary traversal of Complete Binary tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Reverse Level Order traversal in spiral form
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Sum of all the Boundary Nodes of a Binary Tree
- Count of pairs violating BST property
- Sum of nodes in bottom view of Binary Tree
- Distribute candies in a Binary Tree
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- LCA in a tree using Binary Lifting Technique
- Print all leaf nodes of a binary tree from right to left
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Iterative Postorder traversal | Set 3
- Check if two nodes in a Binary Tree are siblings
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Create a mirror tree from the given binary tree
- Print leaf nodes in binary tree from left to right using one stack
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Minimum sum path between two leaves of a binary tree
- Print the first shortest root to leaf path in a Binary Tree
- K-th ancestor of a node in Binary Tree | Set 3

Given a Binary Tree, convert it to a Circular Doubly Linked List. The left and right pointers in nodes are to be used as previous… Read More »

Given a binary tree, the task is to print all the nodes except the leftmost in every level of the tree. The root is considered… Read More »

Given a perfect binary tree of N nodes, with nodes having values from 1 to N as depicted in the image below and Q queries… Read More »

Given a complete binary tree, the task is to find the sum of mirror image nodes in an inorder way i.e. find the inorder traversal… Read More »

Given a binary tree in which nodes are numbered from 1 to N. Given a node and a positive integer K. We have to print… Read More »

Given a Binary Tree, the task is to find the size of largest Complete sub-tree in the given Binary Tree. Complete Binary Tree – A… Read More »

Given Preorder, Inorder and Postorder traversals of some tree. The task is to check if they all are of the same tree. Examples: Input :… Read More »

We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »

Given a Binary Tree, the task is to find the size of largest Perfect sub-tree in the given Binary Tree. Perfect Binary Tree – A… Read More »

Given a binary tree, target node X and a string patt. The task is to find the last node of the binary tree following the… Read More »

Given a Binary Tree, the task is to find the absolute difference between the sums of odd and even positioned nodes. A node is said… Read More »

Given a binary tree, find the sum of all parent-child differences for all the non-leaf nodes of the given binary tree. Note that parent-child difference… Read More »

Given a binary tree, print even positioned nodes of even level in level order traversal. The root is considered at level 0, and the left… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of non-leaf nodes among all level of given… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of leaf nodes among all level of the… Read More »