3 line recursive c++ solution.


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

Log in to reply
 

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