| 121 |
Maximum Level Sum of a Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 122 |
Maximum Product of Splitted Binary Tree |
Medium |
TreeDepth-First SearchBinary Tree |
| 123 |
Maximum Sum BST in Binary Tree |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 124 |
Maximum Width of Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 125 |
Merge BSTs to Create Single BST |
Hard |
Hash TableBinary SearchTree |
| 126 |
Merge Two Binary Trees |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 127 |
Minimum Absolute Difference in BST |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 128 |
Minimum Depth of Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 129 |
Minimum Distance Between BST Nodes |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 130 |
Minimum Flips in Binary Tree to Get Result |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 131 |
Minimum Number of Operations to Sort a Binary Tree by Level |
Medium |
TreeBreadth-First SearchBinary Tree |
| 132 |
Most Frequent Subtree Sum |
Medium |
Hash TableTreeDepth-First Search |
| 133 |
Number of Good Leaf Nodes Pairs |
Medium |
TreeDepth-First SearchBinary Tree |
| 134 |
Number of Nodes With Value One |
Medium |
ArrayTreeDepth-First Search |
| 135 |
Number of Ways to Reorder Array to Get Same BST |
Hard |
ArrayMathDivide and Conquer |