按之字形顺序打印二叉树

题目描述
请实现一个函数按照之字形打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右至左的顺序打印，第三行按照从左到右的顺序打印，其他行以此类推。

/*
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* pRoot) {
        
        stack<TreeNode*> s1;
        stack<TreeNode*> s2;
        vector<vector<int> > vec;
        vector<int> ve;
        if(pRoot == NULL) return vec;
        TreeNode* p=pRoot;
        s1.push(p);
        //ve.push_back(p->v);
        int i=0;
        while(true){
            if(i%2==0){
                while(!s1.empty()){
                    TreeNode* t=s1.top();
                    s1.pop();
                    ve.push_back(t->val);
                    if(t->left) s2.push(t->left);
                    if(t->right) s2.push(t->right);
                    
                }
                i++;
            }
            else{
                while(!s2.empty()){
                    TreeNode* t=s2.top();
                    s2.pop();
                    ve.push_back(t->val);
                    if(t->right) s1.push(t->right);
                    if(t->left) s1.push(t->left); 
                }
                i++;
            }
            vec.push_back(ve);
            ve.clear();
            if(s1.empty()&&s2.empty()) break;
        }        
        return vec;
    }
    
};