| 1 |
Add One Row to Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 2 |
All Elements in Two Binary Search Trees |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 3 |
All Nodes Distance K in Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 4 |
All Possible Full Binary Trees |
Medium |
Dynamic ProgrammingTreeRecursion |
| 5 |
Amount of Time for Binary Tree to Be Infected |
Medium |
Hash TableTreeDepth-First Search |
| 6 |
Average of Levels in Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 7 |
Balance a Binary Search Tree |
Medium |
Divide and ConquerGreedyTree |
| 8 |
Balanced Binary Tree |
Easy |
TreeDepth-First SearchBinary Tree |
| 9 |
Binary Search Tree Iterator |
Medium |
StackTreeDesign |
| 10 |
Binary Search Tree Iterator II |
Medium |
StackTreeDesign |
| 11 |
Binary Search Tree to Greater Sum Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 12 |
Binary Tree Cameras |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 13 |
Binary Tree Coloring Game |
Medium |
TreeDepth-First SearchBinary Tree |
| 14 |
Binary Tree Inorder Traversal |
Easy |
StackTreeDepth-First Search |
| 15 |
Binary Tree Level Order Traversal |
Medium |
TreeBreadth-First SearchBinary Tree |