给定一个二叉树,找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。
示例:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回它的最大深度 3 。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
#include <iostream>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL){
return 0;
}else{
length = 1;
}
return countlevel(root,length);
}
int countlevel(TreeNode* root, int len){
if(root==NULL)
return len;
int v1 = len;
int v2 = len;
if(root->left){
v1 = countlevel(root->left,len+1);
}
if(root->right){
v2 = countlevel(root->right,len+1);
}
return max(v1,v2);
}
private:
int length;
};
int main(){
// TreeNode *root = new TreeNode(3);
// TreeNode *l1 = new TreeNode(9);
// TreeNode *r1 = new TreeNode(20);
// TreeNode *rl2 = new TreeNode(15);
// TreeNode *rr2 = new TreeNode(7);
// root->left = l1;
// root->right = r1;
// l1->left = rl2;
// l1->right = rr2;
TreeNode *root = new TreeNode(3);
TreeNode *l1 = new TreeNode(9);
TreeNode *r1 = new TreeNode(20);
root->left = l1;
root->right = r1;
Solution *ps = new Solution();
int res = ps->maxDepth(root);
printf("result = %d\n",res);
return 0;
}