题目描述:
思路:递归法,分别求出左子树高度和右子树高度,然后返回更大高度的子树的值加1 ,思路很简单,大家将上面的样例代入代码就能理解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int maxDepth(struct TreeNode* root){
if(root==NULL)
return 0;
else
{
int n,m;
n=maxDepth(root->left);
m=maxDepth(root->right);
return (n>m)?n+1:m+1;
}
}
结果: