Javascript solution 124ms


  • 2
    M

    //recursion, the worst case log(n)
    var maxDepth = function(root) {

    if (root === null) {
        return 0;
    }
    return 1 + Math.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.