解题思路:
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL)return 0;
int l=maxDepth(root->left);
int r=maxDepth(root->right);
return (l>r?l:r)+1;
}
};
解题思路:
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL)return 0;
int l=maxDepth(root->left);
int r=maxDepth(root->right);
return (l>r?l:r)+1;
}
};