simple, simple, simple


  • 0
    C
     public int minDepth(TreeNode root) {
            if(root == null) {
                return 0;
            }
            if(root.left!=null && root.right == null){
                return 1+minDepth(root.left);
            }
            if(root.right!=null && root.left == null) {
                return 1+minDepth(root.right);
            }
            return 1+Math.min(minDepth(root.left),minDepth(root.right));
        }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.