递归
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==nullptr)return 0;
return(max(maxDepth(root->left),maxDepth(root->right)))+1;
}
};
递归
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==nullptr)return 0;
return(max(maxDepth(root->left),maxDepth(root->right)))+1;
}
};