Java Recursive Short Solution


  • 2
    C
    public class Solution 
    {
        public int maxDepth(TreeNode 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.