Every day a leetcode
题目来源:104. 二叉树的最大深度
解法1:递归
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int max(int a,int b)
{
return a>b?a:b;
}
int maxDepth(struct TreeNode* root){
if(root == NULL) return 0;
int lDepth=maxDepth(root->left);
int rDepth=maxDepth(root->right);
return max(lDepth,rDepth)+1;
}
结果: