my clear c++ solution


  • 0
    F
    int maxDepth(TreeNode* root) {
            if(root==NULL) return 0;
            else return max(maxDepth(root->left),maxDepth(root->right))+1;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.