leetcode 102 Binary Tree Level Order Traversal

leetcode 102 Binary Tree Level Order Traversal

https://leetcode.com/problems/binary-tree-level-order-traversal/

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

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

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

解法：用一个队列就可以，另外用count统计每层的节点数目

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.LinkedBlockingQueue;
public class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res=new ArrayList<List<Integer>>();
        LinkedBlockingQueue queue=new LinkedBlockingQueue();
        if(root==null)return res;
        queue.add(root);
        int count=1;
        while(!queue.isEmpty()){
            int count2=0;
            List<Integer> temp=new ArrayList<Integer>();
            while(count>0&&!queue.isEmpty()){
                
                TreeNode head=(TreeNode) queue.poll();
                temp.add(head.val);
                if(head.left!=null){
                    queue.add(head.left);
                    count2++;
                }
                if(head.right!=null){
                    queue.add(head.right);
                    count2++;
                }
                count--;
            }
            count=count2;
            res.add(temp);
        }
        
        return res;
    }
}