class Solution {
public:
int maxDepth(TreeNode* root) {
int depth = 0;
if(!root) return 0;
depth++;
int left = 0;
int right = 0;
left = maxDepth(root->left);
right = maxDepth(root->right);
return left>=right?depth+left:depth+right;
}
};
public:
int maxDepth(TreeNode* root) {
int depth = 0;
if(!root) return 0;
depth++;
int left = 0;
int right = 0;
left = maxDepth(root->left);
right = maxDepth(root->right);
return left>=right?depth+left:depth+right;
}
};