My Accepted Java Solution


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

  • 0
    P
    This post is deleted!

  • 0
    M

    Well, re notes by the moderator: what are the options to format your post, I don't see any guidelines...


Log in to reply
 

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