(三)剑指offer 57 二叉树的之子打印（栈） 58 按行打印（队列）

1、之字形打印（两个栈）；

/*
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>>result;
        vector<int>temp;
        if(!pRoot)    return result;
        TreeNode *node=pRoot;
        stack<TreeNode *>stack[2];
        int cur=0;
        int next=1;
        stack[0].push(node);
        while(stack[cur].size()||stack[next].size())
        {
            TreeNode *pNode=stack[cur].top();
            stack[cur].pop();
            temp.push_back(pNode->val);
            if(cur==0)
            {
                if(pNode->left)stack[next].push(pNode->left);
                if(pNode->right)stack[next].push(pNode->right);
            }
            if(cur==1)
            {
                if(pNode->right)stack[next].push(pNode->right); 
                if(pNode->left)stack[next].push(pNode->left);
            }
            if(stack[cur].empty())
            {
                result.push_back(temp);
                temp.clear();
                cur=next;
                next=1-next;
            }
        }
        return result;
    }
    
};

2、

题目描述

从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

代码：

/*
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> > result;
            vector<int>temp;
            if(!pRoot)return result;
            TreeNode *root=pRoot;
            queue<TreeNode *>cur;
            queue<TreeNode *>next;

            cur.push(root);
            while(cur.size())
            {
                TreeNode *node=cur.front();
                cur.pop();
                temp.push_back(node->val);
                if(node->left)next.push(node->left);
                if(node->right)next.push(node->right);
                if(cur.empty())
                {
                    result.push_back(temp);
                    temp.clear();
                    swap(cur,next);
                }
            }
            return result;
        }
    
};