class Solution {
public:
int maxDepth(TreeNode* root) {
if(!root) return 0;
int leftdepth=maxDepth(root->left);
int rightdepth=maxDepth(root->right);
return leftdepth>rightdepth?(leftdepth+1):(rightdepth+1);
}
};
104. Maximum Depth of Binary Tree
最新推荐文章于 2024-10-15 15:32:42 发布