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.

 

求二叉树的最大深度问题用到深度优先搜索DFS，递归的完美应用，跟求二叉树的最小深度问题原理相同。代码如下：

 

class Solution {public:    int maxDepth(TreeNode* root) {        if (!root) return 0;        return 1 + max(maxDepth(root->left), maxDepth(root->right));    }};

 

求二叉树的最小深度可以参见我的博文：

http://www.cnblogs.com/grandyang/p/4042168.html

 

LeetCode All in One 题目讲解汇总(持续更新中...)