## Inorder Successor of a node in Binary Tree

Given a binary tree and a node, we need to write a program to find inorder successor of this node. Inorder Successor of a node… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Iterative Postorder traversal | Set 3
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- LCA in a tree using Binary Lifting Technique
- Sum of nodes in bottom view of Binary Tree
- Check if two nodes in a Binary Tree are siblings
- Print all leaf nodes of a binary tree from right to left
- Create a mirror tree from the given binary tree
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- 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
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | 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
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Iterative approach to check for children sum property in a Binary Tree
- Find the largest Complete Subtree in a given Binary Tree
- Flatten Binary Tree in order of Level Order Traversal
- 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
- Iterative approach to check if a Binary Tree is Perfect
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Reverse alternate levels of a perfect binary tree using Stack
- 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

Given a binary tree and a node, we need to write a program to find inorder successor of this node. Inorder Successor of a node… Read More »

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

Given a binary tree, find the sum of all the leaf nodes. Examples: Input : 1 / \ 2 3 / \ / \ 4… Read More »

Given a Binary Tree, find sum of all right leaves in it. Similar article : Find sum of all left leaves in a given Binary… Read More »

Given the binary Tree and the two nodes say ‘a’ and ‘b’, determine whether the two nodes are cousins of each other or not. Two… Read More »

It depends on what traversals are given. If one of the traversal methods is Inorder then the tree can be constructed, otherwise not. Therefore, following… Read More »