Leetcode 103. 二叉树的锯齿形层次遍历

/**
 * Definition for a binary tree node.
 * 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<vector<int>> ans;
        queue<TreeNode*> q[2];
        int f=0;
        if(root) q[f].push(root);
        while(!q[f].empty()){
            vector<int> tmp;
            while(!q[f].empty()){
                auto x=q[f].front();q[f].pop();
                tmp.push_back(x->val);
                if(x->left) q[f^1].push(x->left);
                if(x->right) q[f^1].push(x->right);
            }
            if(f) reverse(tmp.begin(),tmp.end());
            ans.push_back(tmp);
            f^=1;
        }
        return ans;
    }
};