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],

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

answer:

class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<TreeNode *> pre;
        vector<vector<int>> result;
        int flag = 0;
        pre.push_back(root);
        while(!pre.empty()){
            myZig(pre,result,flag);
        }
        return result;
    }
    
    void myZig(vector<TreeNode*> & pre, vector<vector<int>> & result, int & flag){
        vector<TreeNode*> temp;
        vector<int> level;
        for(int i = pre.size() - 1; i >= 0; i --){
            TreeNode * now = pre[i];
            if(now){
                if(flag == 0){
                    temp.push_back(now->right);
                    temp.push_back(now->left);
                }
                else{
                    temp.push_back(now->left);
                    temp.push_back(now->right);
                }
            }
        }
        for( int i = 0; i < pre.size(); i ++){
            TreeNode * now = pre[i];
            if(now){
                level.push_back(now->val);
            }
        }
        flag = 1 - flag;
        if(!level.empty())
            result.push_back(level);
        pre = temp;
        return;
    }
};