| 106 |
Linked List in Binary Tree |
Medium |
Linked ListTreeDepth-First Search |
| 107 |
Longest Univalue Path |
Medium |
TreeDepth-First SearchBinary Tree |
| 108 |
Longest ZigZag Path in a Binary Tree |
Medium |
Dynamic ProgrammingTreeDepth-First Search |
| 109 |
Lowest Common Ancestor of a Binary Search Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 110 |
Lowest Common Ancestor of a Binary Tree |
Medium |
TreeDepth-First SearchBinary Tree |
| 111 |
Lowest Common Ancestor of a Binary Tree II |
Medium |
TreeDepth-First SearchBinary Tree |
| 112 |
Lowest Common Ancestor of a Binary Tree III |
Medium |
Hash TableTwo PointersTree |
| 113 |
Lowest Common Ancestor of a Binary Tree IV |
Medium |
Hash TableTreeDepth-First Search |
| 114 |
Lowest Common Ancestor of Deepest Leaves |
Medium |
Hash TableTreeDepth-First Search |
| 115 |
Make Costs of Paths Equal in a Binary Tree |
Medium |
ArrayDynamic ProgrammingGreedy |
| 116 |
Maximum Average Subtree |
Medium |
TreeDepth-First SearchBinary Tree |
| 117 |
Maximum Binary Tree |
Medium |
ArrayDivide and ConquerStack |
| 118 |
Maximum Binary Tree II |
Medium |
TreeBinary Tree |
| 119 |
Maximum Depth of Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 120 |
Maximum Difference Between Node and Ancestor |
Medium |
TreeDepth-First SearchBinary Tree |