Problems
Binary Tree
Choose difficulty level to view problems.
0%
Mastery
Binary Tree Progress
0
/ 40
Questions Solved in Binary Tree
Easy
0
/ 13
Medium
0
/ 16
Hard
0
/ 11
| # | Problem | Status | Practice On Practice | Companies |
|---|---|---|---|---|
| 1 |
|
Binary Tree Zigzag Level Order Traversal · 8 Companies
|
||
| 2 |
|
Binary Tree Right Side View · 8 Companies
|
||
| 3 |
|
Populating Next Right Pointers in Each Node · 7 Companies
|
||
| 4 |
|
Cousins in Binary Tree · 4 Companies
|
||
| 5 |
|
Lowest Common Ancestor of a Binary Tree · 9 Companies
|
||
| 6 |
|
Path Sum III · 6 Companies
|
||
| 7 |
|
Path Sum II · 6 Companies
|
||
| 8 |
|
Construct Binary Tree from Preorder and Inorder Traversal · 3 Companies
|
||
| 9 |
|
Construct Binary Tree from Inorder and Postorder Traversal · 6 Companies
|
||
| 10 |
|
Diameter of Binary Tree · 6 Companies
|
||
| 11 |
|
Sum Root to Leaf Numbers · 5 Companies
|
||
| 12 |
|
Count Complete Tree Nodes · 6 Companies
|
||
| 13 |
|
Check Completeness of a Binary Tree · 5 Companies
|
||
| 14 |
|
Flatten Binary Tree to Linked List · 7 Companies
|
||
| 15 |
|
All Nodes Distance K in Binary Tree · 6 Companies
|
||
| 16 |
|
Maximum Width of Binary Tree · 7 Companies
|
