Binary Tree Level Order Traversal （easy）

【题目】

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

【题意】

     层次遍历二叉树，并且按照一层一层那样放。

【分析】

     重点在于如何判断每一层的结束和下一层的开始。如果只用一个队列的话，需要给每个结点额外定义一个bool变量用来区分不同层。如果不想另外定义变量的话，可以使用两个队列，对于不同层交替使用。swap方法可以完成两个队列的交替。

【实现】

 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int> > levelOrder(TreeNode *root) {
        vector<vector<int>> levels;
        if(!root) return levels;
        queue<TreeNode*> curque, nextque;
        vector<int>* lev = new vector<int>();
        curque.push(root);
        while(!curque.empty()){
            TreeNode* curNode = curque.front();
            curque.pop();
            lev -> push_back(curNode -> val);
            if(curNode -> left) nextque.push(curNode -> left);
            if(curNode -> right) nextque.push(curNode -> right);
            if(curque.empty()){
                levels.push_back(*lev);
                lev = new vector<int>();
                swap(curque, nextque);
            }
        }
        return levels;
    }
};

java：

/**
 * Definition for binary tree
 * public class TreeNode {
 *	 int val;
 *	 TreeNode left;
 *	 TreeNode right;
 *	 TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
  public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
    ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
    if (root == null) {
      return res;
    }
    ArrayList<Integer> tmp = new ArrayList<Integer>();
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    queue.offer(root);
    int num;
    while (!queue.isEmpty()) {
      num = queue.size();
      tmp.clear();
      for (int i = 0; i < num; i++) {
        TreeNode node = queue.poll();
        tmp.add(node.val);
        if (node.left != null)
          queue.offer(node.left);
        if (node.right != null)
          queue.offer(node.right);
      }
  
      res.add(new ArrayList<Integer>(tmp));
    }
    return res;
  }
}