Binary Tree Zigzag 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> > zigzagLevelOrder(TreeNode *root) 
    {
        vector<int> cur;
        vector<vector<int>> result;
        if(root==NULL)
            return result;
        queue<TreeNode* > q;
        q.push(root);
        int count=1;
        bool left2right=true;
        while(!q.empty())
        {
            TreeNode* temp=q.front();
            q.pop();
            cur.push_back(temp->val);
            --count;
            if(temp->left)
                q.push(temp->left);
            if(temp->right)
                q.push(temp->right);
            if(count==0)
            {
                count=q.size();
                if(!left2right)
                    reverse(cur.begin(),cur.end());
                result.push_back(cur);
                left2right=!left2right;
                cur.clear();

            }
        }
        
        return result;
    }
};