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) {
        int c = 1;
        TreeNode tmp;
        Queue<TreeNode> Q = new LinkedList<> ();
        
        if (root ==  null) return 0;
        
        Q.offer(root);
        Q.offer(null);
        while (!Q.isEmpty()) {
            tmp = Q.poll();
            if (tmp != null) {
                
                if (tmp.left == null && root.right == null) {
                    System.out.println("root value is " + root.val );
                    break;
                }  <====这里没有执行！！！！！！！！！！！！！
                
                if (tmp.left != null) {
                    Q.offer(tmp.left);
                    System.out.println("cl is " + c);
                } else {
                    System.out.println("left is null,c is " + c);
               
                }
                                
                if (tmp.right != null) {
                    Q.offer(tmp.right);
                    System.out.println("cr is " + c);
                }  
            }
            if (tmp == null) {
                
                if (!Q.isEmpty()) {
                    Q.offer(null);
                    c++;
                }
            }                    
        } 
        return c ;
    }
}