Leetcode:Binary Tree Level Order Traversal

/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include<queue>
struct Node{
int num;
TreeNode * v;
Node(int x =1,TreeNode * root=NULL):num(x),v(root){ }
};

class Solution {
public:
vector<vector<int> > levelOrder(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int>>result;
vector<int> tmp;
Node * p=NULL;
Node * t=NULL;
int deep=1;

if( root == NULL)
{
return result;

}

queue<Node *> my_q;
t=new Node(1,root);
my_q.push(t);

while( !my_q.empty() )
{
p=my_q.front();
my_q.pop();

if( deep == p->num )
{
tmp.push_back(p->v->val);
}

else
{
result.push_back(tmp);
tmp.clear();
tmp.push_back(p->v->val);
deep++;
}

if(p->v->left != NULL)
{
t=new Node(p->num+1,p->v->left);
my_q.push(t);
}


if(p->v->right != NULL)
{
t=new Node(p->num+1,p->v->right);
my_q.push(t);
}


}

result.push_back(tmp);
return result;




}
};