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]
]

解题思路
本题的解题思路还是二叉树的层序遍历。因为要每次不同处理，用到了两个队列的方法，一个队列保存当前层的节点，另一个队列保存下一层的节点。

相关知识点
（1）将一个list中的值全部复制到另一个list中

list.addAll(otherList);//直接把要复制的list添加到目的list中就可以了。

（2）对ArrayList中的元素排序

Collections.sort(list);//将list进行排序，升序

自己的代码

package leetcode;

import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

/*class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}*/

public class BinaryTreeLevelOrderTraversal {
	public List<List<Integer>> levelOrder(TreeNode root) {
		List<List<Integer>> list = new ArrayList<List<Integer>>();
		
		if(root == null) return list;
		
		Queue<TreeNode> queue1 = new LinkedList<TreeNode>();
		Queue<TreeNode> queue2 = new LinkedList<TreeNode>();
		queue2.add(root);
		
		while(!queue2.isEmpty()){
			queue1.addAll(queue2);
			queue2.clear();
			List<Integer> tempList = new ArrayList<Integer>();
			while(!queue1.isEmpty()){
				TreeNode head = queue1.poll();
				tempList.add(head.val);
				if(head.left != null) queue2.add(head.left);
				if(head.right != null) queue2.add(head.right);
			}
			//Collections.sort(tempList);
			list.add(tempList);
		}
		
        return list; 
    }
	
	public static void main(String[] args) {
		TreeNode node1 = new TreeNode(3);
		TreeNode node2 = new TreeNode(9);
		TreeNode node3 = new TreeNode(20);
		TreeNode node4 = new TreeNode(15);
		TreeNode node5 = new TreeNode(17);
		
		node1.left = node2;
		node1.right = node3;
		node3.left = node4;
		node3.right = node5;
		
		BinaryTreeLevelOrderTraversal btot = new BinaryTreeLevelOrderTraversal();
		System.out.println(btot.levelOrder(node1).toString());
	}
}