问题:
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.
分析:简单的一道递归题。
代码:
class Solution {
public:
int maxDepth(TreeNode *root) {
if (!root) return 0;
return 1 + max (maxDepth(root->left),maxDepth(root->right));
}
};