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) {}
 * };
 */
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>> ans;
        vector<int> vec;
        int lev1=1,lev2=0;
        TreeNode *p;
        queue<TreeNode*> que;
        if(root!=NULL)que.push(root);
        while(!que.empty()){
            p=que.front();
            vec.push_back(p->val);
            que.pop();
            --lev1;
            if(p->left!=NULL){
                que.push(p->left);
                ++lev2;
            }
            if(p->right!=NULL){
                que.push(p->right);
                ++lev2;
            }
            if(lev1==0){
                ans.push_back(vec);
                vec.clear();
                lev1=lev2;
                lev2=0;
            }
        }
       
        return ans;
        
    }
};