Maximum Depth of Binary Tree
- 题目:leetcode 104
leetcode 104
思路分析:
代码:
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int maxDepth(TreeNode* root) {
if (root==NULL) { //递归出口,处理空树,返回0
return 0;
}
else{
int left = maxDepth(root->left); //分别计算左右子树的最大深度
int right = maxDepth(root->right);
return max(left, right)+1; //取左右子树的最大深度加一就是所要求解的值
}
}