class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL) return 0;
int left = maxDepth( root->left);
int right = maxDepth( root->right);
return (left>right? left:right) + 1;
}
};
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL) return 0;
int left = maxDepth( root->left);
int right = maxDepth( root->right);
return (left>right? left:right) + 1;
}
};
名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
