Java one-line solution


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