leetcode:Binary Tree Level Order Traversal 【队列与二叉树y】

ArrayList result = new ArrayList();
		if(root == null)
			return result;
		
		
		Queue<TreeNode> queue = new LinkedList<TreeNode>();
		queue.offer(root);
		
		while(queue.isEmpty() != true){
			ArrayList<Integer> level = new ArrayList<Integer>();
			int size = queue.size();
			
			for(int i = 0; i <size; i++){
				TreeNode head = queue.poll();
				level.add(head.val);
				
				if(head.left != null){
					queue.offer(head.left);
				}
				
				if(head.right != null){
					queue.offer(head.right);
				}
				
				
			}
			result.add(level);
		}
		return result;
		

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

层次遍历的做法比较固定，首先把第一层的node存进队列（queue）里边，然后再把node的值返回到数组里边

同时向队列offer左右节点

依次