| 106 |
Find Elements in a Contaminated Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 107 |
Find Largest Value in Each Tree Row |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 108 |
Find Leaves of Binary Tree |
Medium |
TreeDepth-First SearchBinary Tree |
| 109 |
Find Minimum Diameter After Merging Two Trees |
Hard |
TreeDepth-First SearchBreadth-First Search |
| 110 |
Find Mode in Binary Search Tree |
Easy |
TreeDepth-First SearchBinary Search Tree |
| 111 |
Find Nearest Right Node in Binary Tree |
Medium |
TreeBreadth-First SearchBinary Tree |
| 112 |
Find Number of Coins to Place in Tree Nodes |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 113 |
Find Root of N-Ary Tree |
Medium |
Hash TableBit ManipulationTree |
| 114 |
Find Subtree Sizes After Changes |
Medium |
ArrayHash TableString |
| 115 |
Find the Last Marked Nodes in Tree |
Hard |
TreeDepth-First Search |
| 116 |
Find the Level of Tree with Minimum Sum |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 117 |
Find the Maximum Sum of Node Values |
Hard |
ArrayDynamic ProgrammingGreedy |
| 118 |
Find Weighted Median Node in Tree |
Hard |
ArrayBinary SearchDynamic Programming |
| 119 |
Flatten Binary Tree to Linked List |
Medium |
Linked ListStackTree |
| 120 |
Flatten Nested List Iterator |
Medium |
StackTreeDepth-First Search |