Easy JAVA in one line..


  • -1
    public class Solution {
        public int maxDepth(TreeNode root) {
            if( root == null ) return 0;
            return ( 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.