| 226 |
Split BST |
Medium |
TreeBinary Search TreeRecursion |
| 227 |
Step-By-Step Directions From a Binary Tree Node to Another |
Medium |
StringTreeDepth-First Search |
| 228 |
Subtree Inversion Sum |
Hard |
ArrayDynamic ProgrammingTree |
| 229 |
Subtree of Another Tree |
Easy |
TreeDepth-First SearchString Matching |
| 230 |
Subtree Removal Game with Fibonacci Tree |
Hard |
MathDynamic ProgrammingTree |
| 231 |
Sum of Distances in Tree |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 232 |
Sum of Left Leaves |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 233 |
Sum of Nodes with Even-Valued Grandparent |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 234 |
Sum of Root To Leaf Binary Numbers |
Easy |
TreeDepth-First SearchBinary Tree |
| 235 |
Sum Root to Leaf Numbers |
Medium |
TreeDepth-First SearchBinary Tree |
| 236 |
Symmetric Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 237 |
Throne Inheritance |
Medium |
Hash TableTreeDepth-First Search |
| 238 |
Time Needed to Inform All Employees |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 239 |
Time Taken to Mark All Nodes |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 240 |
Tree Diameter |
Medium |
TreeDepth-First SearchBreadth-First Search |