Leetcode 103：Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its zigzag level order traversal as:

C++
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        queue<TreeNode*> q;
        vector<vector<int>> res;
        vector<int> level;
        q.push(root);
        q.push(nullptr);
        while(!q.empty())
        {
            TreeNode* temp = q.front();
            q.pop();
            if(temp != nullptr)
            {
                level.push_back(temp->val);
                if(temp->left)
                    q.push(temp->left);
                if(temp->right)
                    q.push(temp->right);
            }
            else
            {
                if(!level.empty())
                {
                    res.push_back(level);
                    level.clear();
                    q.push(nullptr);
                }
            }
        }
        for(int i = 1;i < res.size();)
        {
            std::reverse(res[i].begin(),res[i].end());
            i += 2;
        }
        return res;
    }