| 166 |
Maximum Subtree of the Same Color |
Medium |
ArrayDynamic ProgrammingTree |
| 167 |
Maximum Sum BST in Binary Tree |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 168 |
Maximum Width of Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 169 |
Maximum XOR of Two Non-Overlapping Subtrees |
Hard |
TreeDepth-First SearchGraph |
| 170 |
Merge BSTs to Create Single BST |
Hard |
Hash TableBinary SearchTree |
| 171 |
Merge Two Binary Trees |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 172 |
Minimize the Total Price of the Trips |
Hard |
ArrayDynamic ProgrammingTree |
| 173 |
Minimum Absolute Difference in BST |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 174 |
Minimum Depth of Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 175 |
Minimum Distance Between BST Nodes |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 176 |
Minimum Edge Weight Equilibrium Queries in a Tree |
Hard |
ArrayTreeGraph |
| 177 |
Minimum Flips in Binary Tree to Get Result |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 178 |
Minimum Fuel Cost to Report to the Capital |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 179 |
Minimum Increments to Equalize Leaf Paths |
Medium |
ArrayDynamic ProgrammingTree |
| 180 |
Minimum Number of Operations to Sort a Binary Tree by Level |
Medium |
TreeBreadth-First SearchBinary Tree |