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.

计算出最小的深度：本文运用广度遍历，首先遇到的左右节点为空的叶子节点，该节点的深度为结果值：

class Solution {
    public int minDepth(TreeNode root) {
        if(root == null) {
            return 0;
        }
        int res=0;
        Queue<TreeNode> tmp = new LinkedList<>();
        tmp.add(root);
        while(tmp !=null && !tmp.isEmpty()) {
            res++;
            int size = tmp.size();
            while(size >0) {
                TreeNode peek = tmp.poll();
                if(peek.left ==null && peek.right ==null) {
                    return res;
                }else {
                    if(peek.left!=null) tmp.add(peek.left);
                    if(peek.right!=null) tmp.add(peek.right);
                }
                size--;
            }
        }
        return res;
    }
}