Given a binary tree, find its maximum depth.
e 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 max(maxDepth(root->left),maxDepth(root->right)) + 1;
}
};
递归结束条件
参考资料:
LeetCode题解