算法精粹(algorithm-essentials)

感谢soulmachine@github提供内容
## Maximum Depth of Binary Tree


### 描述

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.


### 分析



### 代码

{% codesnippet "./code/maximum-depth-of-binary-tree."+book.suffix, language=book.suffix %}{% endcodesnippet %}


### 相关题目


* [Minimum Depth of Binary Tree](minimum-depth-of-binary-tree.md)