> For the complete documentation index, see [llms.txt](https://r24zeng.gitbook.io/leetcode-notebook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://r24zeng.gitbook.io/leetcode-notebook/wan-quan-an-zhao-jiu-zhang-suan-fa-shua-de-60-dao-zuo-you/iii.-binary-tree/104.-maximum-depth-of-binary-tree.md).

# 104. Maximum Depth of Binary Tree

{% hint style="success" %}
Divide and Conquer, think from top to bottom
{% endhint %}

### Solution:

1. Stop condition( is also called edge case because only one main function ): `root = None`
2. Find max depth of left and right sub-tree
3. Return (max of left and right max depth + 1)