Hard Problems on Binary Tree Data Structure
- Modify a binary tree to get Preorder traversal using right pointers only
- Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree
- Construct a special tree from given preorder traversal
- Construct tree from ancestor matrix
- Construct the full k-ary tree from its preorder traversal
- Construct Binary Tree from String with bracket representation
- Convert a Binary Tree into Doubly Linked List in spiral fashion
- Convert a Binary Tree to a Circular Doubly Link List
- Convert Ternary Expression to a Binary Tree
- Check if there is a root to leaf path with given sequence
- Remove all nodes which don’t lie in any path with sum>= k
- Maximum spiral sum in Binary Tree
- Sum of nodes at k-th level in a tree represented as string
- Sum of all the numbers that are formed from root to leaf paths
- Merge Two Binary Trees by doing Node Sum (Recursive and Iterative)
- Find root of the tree where children id sum for every node is given
Quick Links :
- ‘Practice Problems’ on Trees
- ‘Quizzes’ on Binary Trees
- ‘Videos’ on Trees
Recommended:
Binary Tree Data Structure
A Binary Tree Data Structure is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. It is commonly used in computer science for efficient storage and retrieval of data, with various operations such as insertion, deletion, and traversal.
Contact Us