Binary Trees [Traversals, Medium and Hard Problems]

0.00%

Traversals

#	Problem	Links	Status	Action
1	Introduction to Trees
2	Binary Tree Representation in C++
3	Binary Tree Representation in Java
4	Binary Tree Traversals in Binary Tree
5	Preorder Traversal of Binary Tree
6	Inorder Traversal of Binary Tree
7	Post-order Traversal of Binary Tree
8	Level order Traversal / Level order traversal in spiral form
9	Iterative Preorder Traversal of Binary Tree
10	Iterative Inorder Traversal of Binary Tree
11	Post-order Traversal of Binary Tree using 2 stack
12	Post-order Traversal of Binary Tree using 1 stack
13	Preorder, Inorder, and Postorder Traversal in one Traversal

Medium Problems

#	Problem	Links	Status	Action
1	Height of a Binary Tree
2	Check if the Binary tree is height-balanced or not
3	Diameter of Binary Tree
4	Maximum path sum
5	Check if two trees are identical or not
6	Zig Zag Traversal of Binary Tree
7	Boundary Traversal of Binary Tree
8	Vertical Order Traversal of Binary Tree
9	Top View of Binary Tree
10	Bottom View of Binary Tree
11	Right/Left View of Binary Tree
12	Symmetric Binary Tree

Hard Problems

#	Problem	Links	Status	Action
1	Root to Node Path in Binary Tree
2	LCA in Binary Tree
3	Maximum width of a Binary Tree
4	Check for Children Sum Property
5	Print all the Nodes at a distance of K in a Binary Tree
6	Minimum time taken to BURN the Binary Tree from a Node
7	Count total Nodes in a COMPLETE Binary Tree
8	Requirements needed to construct a Unique Binary Tree \| Theory
9	Construct Binary Tree from inorder and preorder
10	Construct the Binary Tree from Postorder and Inorder Traversal
11	Serialize and deserialize Binary Tree
12	Morris Preorder Traversal of a Binary Tree
13	Morris Inorder Traversal of a Binary Tree
14	Flatten Binary Tree to LinkedList