[ATO] 32（补充）、按之字形顺序打印二叉树

题目描述

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

参考代码

/*
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) {
        vector<vector<int> > res;
        if(pRoot == nullptr)
            return res;
        
        stack<TreeNode*> mStack[2];
        vector<int> mVector;
        int flag = 0;
        mStack[flag].push(pRoot);
        
        while(!mStack[0].empty() || !mStack[1].empty()){
                
            if(flag == 0){
                while(!mStack[0].empty()){
                    TreeNode* node = mStack[0].top();
                    mVector.push_back(node->val);
                    mStack[0].pop();
                    
                    if(node->left)
                        mStack[1].push(node->left);
                    if(node->right)
                        mStack[1].push(node->right);
                }
                
                res.push_back(mVector);
                mVector.clear();
                flag = 1;
            }else if(flag == 1){
                while(!mStack[1].empty()){
                    TreeNode* node = mStack[1].top();
                    mVector.push_back(node->val);
                    mStack[1].pop();
        
                    if(node->right)
                        mStack[0].push(node->right);
                    if(node->left)
                        mStack[0].push(node->left);
                }
                
                res.push_back(mVector);
                mVector.clear();
                flag = 0;
            }
            
        }
            
        return res;
    }
    
};