题目:![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/a1245355bc412004a503061407bcbd4f.png)
解题思路:递归
C#解法
public class Solution {
public int MaxDepth(TreeNode root) {
if(root==null)
{return 0;}
else
{
int leftDepth=MaxDepth(root.left);
int rightDepth=MaxDepth(root.right);
return Math.Max(leftDepth,rightDepth)+1;
}
}
}
结果:![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/05788d77b1e76c1850ed6be8ab172343.png)
C++解法
class Solution {
public:
int maxDepth(TreeNode* root)
{
if(!root)
return 0;
int left=maxDepth(root->left)+1;
int right=maxDepth(root->right)+1;
int depth=left>right?left:right;
return depth;
}
};