按之字形顺序打印二叉树

class Solution {
public:
    vector<vector<int> > Print(TreeNode* pRoot) {
        vector<vector<int> > res;
        if(pRoot == NULL)
        {
            return res;
        }
        //层次遍历，用flag标记顺序
        bool flag = true;
        queue<TreeNode*> q;
        q.push(pRoot);
        while(!q.empty())
        {
            int n = q.size();
            vector<int> temp;
            for(int  i= 0;i < n;i++)
            {
                TreeNode *node = q.front();
                q.pop();
                if(node->left)
                {
                    q.push(node->left);
                }
                if(node->right)
                {
                    q.push(node->right);
                }
                temp.push_back(node->val);
            }
            if(flag == false)
            {
                reverse(temp.begin(), temp.end());
            }
            res.push_back(temp);
            flag = !flag;
        }
        return res;
    }
    
};