【leetcode】102. 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,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

即二叉树的层序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> wholeList = new LinkedList<List<Integer>>();
         if(root==null)
       {
           return wholeList;
       }
//队列储存的是当前层的所有节点，把当前层的所有节点从队列中弹出，值记录在list中，把下一层的所有节点压入队列
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        TreeNode current;
        while(!queue.isEmpty()){
            List<Integer> list = new LinkedList<Integer>();
            int size = queue.size();
            for(int i=0;i<size;i++)
            {
                current = queue.peek();
                queue.poll();
                list.add(current.val);
                if(current.left!=null)
                {
                    queue.offer(current.left);
                }
                if(current.right!=null)
                {
                    queue.offer(current.right);
                }
            }
            wholeList.add(list);
        }
        return wholeList;
        
    }
}