My Java Concise Solution--minimum depth


  • 0
    O
    public class Solution {
        public int minDepth(TreeNode root) {
             if(root == null){
                 return 0;
              }else{
                 if(root.left == null){
                    return 1 + minDepth(root.right);
                 }
                 if(root.right == null){
                    return 1 + minDepth(root.left);
                 }
                 return 1 + Math.min(minDepth(root.right), minDepth(root.left));
              } 
        }
    }

Log in to reply
 

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