2 lines C++ DFS


  • 0
        int maxDepth(TreeNode* root) {
            if(!root) return 0;
            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.