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

解读：给于一颗二叉树。从左到右从上到下，每一层的节点的val值组成一个数组，所以数组再放到一个数组中返回。

思路：BFS算法。从根节点开始，非空根节点入队列。第一个数组只包含根节点的val值，加入到result中。循环队列当队列不为空，下一层的所有节点入队列，并把他们的val值组成的数组加入到result中，继续循环。

代码：

/**
 * 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>> result;
        if(root == NULL) return result;
        int level = 0;
        
        vector<int> first = {root->val};
        result.push_back(first);
        queue<TreeNode*> q;
        q.push(root);
        
        int next = 1;
        
        while(!q.empty()) {
            int num = next;
            next = 0;
            vector<int> val;
            for(int i = 0; i < num; i++){
                TreeNode* t = q.front();
                q.pop();
                if(t->left) {
                    q.push(t->left); 
                    next++;
                    val.push_back(t->left->val);
                }
                if(t->right) {
                    q.push(t->right);
                    next++; 
                    val.push_back(t->right->val);
                }
            }
            if(val.size() != 0)
            result.push_back(val);
        }
        return result;
    }
};