# 4. Divide and Conquer

- [Balanced Binary Tree](/algo/binary-tree/4.-divide-and-conquer/balanced-binary-tree.md): ID: 110; easy
- [Minimum Subtree](/algo/binary-tree/4.-divide-and-conquer/minimum-subtree.md): ID: 596; easy; 最小子树
- [Subtree with Maximum Average](/algo/binary-tree/4.-divide-and-conquer/subtree-with-maximum-average.md): ID: 597; easy
- [Maximum Subtree](/algo/binary-tree/4.-divide-and-conquer/maximum-subtree.md): ID: 628; easy
- [Lowest Common Ancestor of a Binary Tree](/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-of-a-binary-tree.md): ID: 88; medium
- [Lowest Common Ancestor II](/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-ii.md): ID: 474; easy
- [Lowest Common Ancestor III](/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-iii.md): ID: 578; medium
- [Binary Tree Maximum Path Sum II](/algo/binary-tree/4.-divide-and-conquer/binary-tree-maximum-path-sum-ii.md): ID: 475; medium
- [Binary Tree Maximum Path Sum](/algo/binary-tree/4.-divide-and-conquer/binary-tree-maximum-path-sum.md): ID: 94; medium
- [Path Sum III](/algo/binary-tree/4.-divide-and-conquer/path-sum-iii.md): ID: 437; medium