按之字形顺序打印二叉树 (C++牛客网）

（1）队列，翻转

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    vector<vector<int> > Print(TreeNode* root) {
        queue<TreeNode*> q;
        vector<vector<int> > vec;
        if(!root) return vec;
        q.push(root);
        int level=0;
        while(!q.empty()) {
            int size=q.size();
            vector<int> v;
            while(size!=0) {
                TreeNode *temp=q.front();
                q.pop();
                size--;
                v.push_back(temp->val);
                if(temp->left) q.push(temp->left);
                if(temp->right) q.push(temp->right);
            }
            if(level%2==1) reverse(v.begin(),v.end());
            level++;
            vec.push_back(v);
        }
        return vec;
    }
    
};