{leetcode}/problems/maximum-depth-of-binary-tree/[LeetCode - 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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its depth = 3.
后根遍历，当然也可以使用BFS遍历。
- 一刷
-
link:{sourcedir}/_0104_MaximumDepthOfBinaryTree.java[role=include] - 二刷
-
link:{sourcedir}/_0104_MaximumDepthOfBinaryTree_2.java[role=include] - 三刷
-
link:{sourcedir}/_0104_MaximumDepthOfBinaryTree_3.java[role=include]
思考题：尝试使用迭代方式来解决一下。