Binary Trees · DSA Java Articles

Traversals

ID	Problem	Difficulty	Section	Sheets
2865	Introduction to Trees	Easy	Traversals	A2Z
2864	Binary Tree Representation in Java	Easy	Traversals	A2Z
136	Pre, Post, Inorder in one traversal	Easy	Traversals	A2Z SDE
137	Preorder Traversal	Easy	Traversals	A2Z
2785	Inorder Traversal of Binary Tree	Easy	Traversals	A2Z
135	Postorder Traversal	Easy	Traversals	A2Z SDE
134	Level Order Traversal	Easy	Traversals	A2Z SDE B75
2872	Iterative Preorder Traversal of Binary Tree	Easy	Traversals	A2Z
2786	Iterative Inorder Traversal of Binary Tree	Easy	Traversals	A2Z
2788	Post-order Traversal of Binary Tree using 2 stack	Easy	Traversals	A2Z
2787	Post-order Traversal of Binary Tree using 1 stack	Easy	Traversals	A2Z
2789	Preorder, Inorder, and Postorder Traversal in one Traversal	Easy	Traversals	A2Z
133	Inorder Traversal	Easy	Traversals	SDE
2790	Preorder Traversal	Easy	Traversals	SDE

ID	Problem	Difficulty	Section	Sheets
131	Maximum Depth in BT	Medium	Medium Problems	A2Z SDE B75
127	Check for balanced binary tree	Medium	Medium Problems	A2Z SDE
130	Diameter of Binary Tree	Easy	Medium Problems	A2Z SDE
132	Maximum path sum	Medium	Medium Problems	A2Z SDE B75
129	Check if two trees are identical or not	Medium	Medium Problems	A2Z SDE B75
126	Zig Zag or Spiral Traversal	Medium	Medium Problems	A2Z SDE
116	Boundary Traversal	Medium	Medium Problems	A2Z SDE
125	Vertical Order Traversal	Medium	Medium Problems	A2Z SDE
124	Top View of BT	Medium	Medium Problems	A2Z SDE
115	Bottom view of BT	Medium	Medium Problems	A2Z SDE
2782	Right/Left View of Binary Tree	Medium	Medium Problems	A2Z
2784	Symmetric Binary Tree	Medium	Medium Problems	A2Z SDE
123	Right/Left View of BT	Medium	Medium Problems	SDE
128	Check for symmetrical BTs	Medium	Medium Problems	SDE
823	Populating Next Right Pointers in Each Node	Medium	Medium Problems	SDE
2783	Invert/Flip Binary Tree (Create)	Medium	Medium Problems	B75
2408	Subtree of Another Tree	Easy	Medium Problems	B75

ID	Problem	Difficulty	Section	Sheets
122	Print root to leaf path in BT	Medium	Hard Problems	A2Z SDE
118	LCA in BT	Hard	Hard Problems	A2Z SDE
119	Maximum Width of BT	Medium	Hard Problems	A2Z SDE
185	Children Sum Property in Binary Tree	Medium	Hard Problems	A2Z SDE
121	Print all nodes at a distance of K in BT	Hard	Hard Problems	A2Z
120	Minimum time taken to burn the BT from a given Node	Hard	Hard Problems	A2Z
117	Count total nodes in a complete BT	Easy	Hard Problems	A2Z
111	Requirements needed to construct a unique BT	Medium	Hard Problems	A2Z
110	Construct a BT from Preorder and Inorder	Hard	Hard Problems	A2Z SDE
2781	Construct the Binary Tree from Postorder and Inorder Traversal	Hard	Hard Problems	A2Z B75
112	Serialize and De-serialize BT	Hard	Hard Problems	A2Z SDE B75
2791	Morris Preorder Traversal of a Binary Tree	Hard	Hard Problems	A2Z
2792	Morris Inorder Traversal of a Binary Tree	Hard	Hard Problems	A2Z
486	Flatten Binary Tree to Linked List	Medium	Hard Problems	A2Z SDE
139	Morris Inorder Traversal	Hard	Hard Problems	SDE
138	Morris Preorder Traversal	Hard	Hard Problems	SDE
109	Construct a BT from Postorder and Inorder	Hard	Hard Problems	SDE
62	Binary Tree to Doubly Linked List	Medium	Hard Problems	SDE