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

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

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

Solution:

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

        return res;
    }
};