[Leetcode] 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > res;
        if (!root) return res;
        
        stack<TreeNode*> curLevel;
        stack<TreeNode*> nextLevel;
        
        curLevel.push(root);
        
        vector<int> temp;
        bool left2Right = true;
        while (!curLevel.empty())
        {            
            TreeNode* cur = curLevel.top();
            temp.push_back(cur->val);
            curLevel.pop();
            
            if (left2Right)
            {
                if (cur->left) nextLevel.push(cur->left);
                if (cur->right) nextLevel.push(cur->right);
            }
            else
            {
                if (cur->right) nextLevel.push(cur->right);
                if (cur->left) nextLevel.push(cur->left);
            }
            
            if (curLevel.empty())
            {
                left2Right = !left2Right;
                swap(curLevel, nextLevel);
                res.push_back(temp);
                temp.clear();
            }
        }
        
        return res;
    }
};