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,#,#,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) {
        queue<TreeNode*> parent, child;
        vector<vector<int>> vv;
        vector<int> v;
        if(root == NULL)
            return vv;
        parent.push(root);
        do
        {
            queue<TreeNode*> child;
            while(!parent.empty())
            {
                TreeNode *t = parent.front();
                parent.pop();
                v.push_back(t->val);
                if(t->left)
                    child.push(t->left);
                if(t->right)
                    child.push(t->right);
            }
            parent = child;
            vv.push_back(v);
            v.clear();
        }while(!parent.empty());
        return vv;
    }
};