My solution using recursion


  • 0
    V
    class Solution {
    public:
        int maxDepth(TreeNode* root) {
            if( !root )
                return 0;
    
            return 1 + 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.