recursive solution


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

Log in to reply
 

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