LeetCode102 Binary Tree Level Order Traversal Java

题目：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]
]

题目就是常规的层次遍历，但是其中你要输出的跟常规的有点不一样，你需要将每一层的节点单独放到一个List中去，这就需要你去区分每一层节点个数。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> listAll = new ArrayList<>();
        if (root == null) {
            return listAll;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()) {
            List<Integer> listLevel = new ArrayList<>();
            int sizeLevel = queue.size();//记录下每一层有多少节点
            for (int i = 0; i < sizeLevel; i++) {
                if (queue.peek().left != null) {
                    queue.offer(queue.peek().left);
                }
                if(queue.peek().right != null) {
                    queue.offer(queue.peek().right);
                }
                listLevel.add(queue.poll().val);//将一层所有的节点都放到listLevel中去
                //循环几次，就添加几个
            }
            listAll.add(listLevel);//全部循环完后，将其加入到最终的list
        }
        return listAll;
    }
}