leetcode#之字形打印二叉树

class Solution {
public:
     vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if(root==NULL) return res;
        queue<TreeNode *> q;
        q.push(root);
        stack<TreeNode *> s;
        int toprint = 1;
        int nextlevel = 0;
        int flag = 0;
        vector<int> one;
        while(!q.empty())
        {
            for(int i=0;i<toprint;i++)
            {
                TreeNode * cur = q.front();
                one.push_back(cur->val);
                s.push(cur);
                q.pop();
            }
            while(!s.empty())
            {
                TreeNode * cur = s.top();
                if(flag)//偶数行
                {
                    if(cur->left) {q.push(cur->left);nextlevel++;}
                    if(cur->right) {q.push(cur->right);nextlevel++;}