按之字形顺序打印二叉树

题目描述

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

/*
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==NULL) return res;
        deque<TreeNode*> s;//双端队列
        s.push_front(pRoot);
        bool flag = true;//标志位，正向反向
        while(!s.empty())
        {
            vector<int> temp;
            int size = s.size();
            int count = 0;
            while(count<size)
            {
                   TreeNode* t;
                    if(flag)//从左往右输出
                    {
                     t = s.front();s.pop_front();//从队首读取
                     if(t->left) s.push_back(t->left);//为了顺序不乱掉，从左往右输出时，按左子树右子树的顺序存入
                    if(t->right) s.push_back(t->right);
                    }
                    else
                    {
                    t = s.back();s.pop_back();
                    if(t->right) s.push_front(t->right);//从右往左输出时，按右子树左子树的顺序存入
                    if(t->left) s.push_front(t->left);
                    }
                    temp.push_back(t->val);
                    count++;
            }
            if(flag) flag = false;
            else flag = true;
            res.push_back(temp);
        }
        return res;
    }    
};

看看别的思路

class Solution {
public:
    vector<vector<int> > Print(TreeNode* pRoot) {
        vector<vector<int>> res;
        queue<TreeNode*> Q;
        if(!pRoot) return res;
        Q.push(pRoot);
        bool flag = true;
        while(!Q.empty()){
            int len = Q.size();
            vector<int> tmp(len, -1);
            for(int i = 0; i < len; ++i){
                 TreeNode *p = Q.front();
                Q.pop();
                if(p->left) Q.push(p->left);
                if(p->right) Q.push(p->right);
                int index = flag ? i : len - 1 - i;//很有意思
                tmp[index] = p->val;
            }
            flag = !flag;
            res.push_back(tmp);
        }
        return res;
    }   
};