leetcode #111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
return its minimum depth = 2.

思路
和判断最大深度思路基本一致
唯一修改的就是再min函数中
如果root为null 则赋值一个invaildnumber
if(root == null){
return Integer.MAX_VALUE; //如果节点为空,返回一个 invaild number;
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int minDepth(TreeNode root) {
        if(root == null){
            return 0;
        }
        
        return min(root);
    }
    
    public int min(TreeNode root){
          if(root == null){
            return Integer.MAX_VALUE; //如果节点为空,返回一个 invaild number;
        }
        
        if(root.left == null&&root.right == null){
            return 1;
        }
      
        int left =min(root.left);
        int right = min(root.right);
        return Math.min(left,right) +1;
    }
}