102. Binary Tree Level Order Traversal(层次遍历)

题目链接：https://leetcode.com/problems/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,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

解决思路：层次遍历，申请两个队列，每一层都进行交换。

代码如下：

/**
 * Definition for a binary tree node.
 * 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>> res;
      queue<TreeNode*> cur,next;
      if(root == nullptr) return res;
      else cur.push(root);
      while(!cur.empty()){
          vector<int> level;//element in one level
          while(!cur.empty()){
            TreeNode* node = cur.front();
            cur.pop();
            level.push_back(node->val);
            if(node->left!=nullptr) next.push(node->left);
            if(node->right!=nullptr) next.push(node->right);
          }
          res.push_back(level);
          swap(next,cur);
      }
      return res;
    }
};