| 151 |
Same Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 152 |
Search in a Binary Search Tree |
Easy |
TreeBinary Search TreeBinary Tree |
| 153 |
Second Minimum Node In a Binary Tree |
Easy |
TreeDepth-First SearchBinary Tree |
| 154 |
Serialize and Deserialize Binary Tree |
Hard |
StringTreeDepth-First Search |
| 155 |
Serialize and Deserialize BST |
Medium |
StringTreeDepth-First Search |
| 156 |
Smallest String Starting From Leaf |
Medium |
StringBacktrackingTree |
| 157 |
Smallest Subtree with all the Deepest Nodes |
Medium |
Hash TableTreeDepth-First Search |
| 158 |
Split BST |
Medium |
TreeBinary Search TreeRecursion |
| 159 |
Step-By-Step Directions From a Binary Tree Node to Another |
Medium |
StringTreeDepth-First Search |
| 160 |
Subtree of Another Tree |
Easy |
TreeDepth-First SearchString Matching |
| 161 |
Subtree Removal Game with Fibonacci Tree |
Hard |
MathDynamic ProgrammingTree |
| 162 |
Sum of Left Leaves |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 163 |
Sum of Nodes with Even-Valued Grandparent |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 164 |
Sum of Root To Leaf Binary Numbers |
Easy |
TreeDepth-First SearchBinary Tree |
| 165 |
Sum Root to Leaf Numbers |
Medium |
TreeDepth-First SearchBinary Tree |