剑指offer59和60题，打印二叉树-CSDN博客

本文链接：https://blog.csdn.net/csg3140100993/article/details/108328116

//之字形打印二叉树,栈+队列,根节点设为第0层
/*
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;
            queue<TreeNode*> q;
            q.push(pRoot);
            int flag=1;
            stack<TreeNode*> st;
            while(!q.empty()){
                int high=q.size();
                vector<int> temp;
                if(flag==0){//如果是偶数层，则逆序输出
                    for(int i=0;i<high;i++){
                        TreeNode* tmp=q.front();
                        st.push(tmp);
                        q.pop();
                        if(tmp->left) q.push(tmp->left);
                        if(tmp->right) q.push(tmp->right);
                    }
                    while(!st.empty()){//栈的特性，让我们的数据可以逆序输出
                        TreeNode* st_tmp=st.top();
                        st.pop();
                        temp.push_back(st_tmp->val);
                    }
                    flag=1;
                }else if(flag==1){//如果是奇数层，则顺序输出
                    for(int i=0;i<high;i++){
                        TreeNode* tmp=q.front();
                        q.pop();
                        temp.push_back(tmp->val);
                        if(tmp->left) q.push(tmp->left);
                        if(tmp->right) q.push(tmp->right);
                    }
                    flag=0;
                 }
                res.push_back(temp);
            }
            return res;
        }
    
};

//层序打印二叉树
/*
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;
            queue<TreeNode*> q;
            q.push(pRoot);
            while(!q.empty()){
                int high=q.size();
                vector<int> temp;
                for(int i=0;i<high;i++){
                    TreeNode* tmp=q.front();
                    q.pop();
                    temp.push_back(tmp->val);
                    if(tmp->left) q.push(tmp->left);
                    if(tmp->right) q.push(tmp->right);
                }
                res.push_back(temp);
            }
            return res;
        }
    
};