Java 1 line solution 1ms beats 100%


  • 0

    Traverse tree recursively until you reach the leaf node.

    int maxDepth(TreeNode root) {
        return root == null ? 0 : 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.