2018.5.22（二叉树的遍历-非递归（手动压栈））

遍历解释–递归版https://blog.csdn.net/Violet_ljp/article/details/80378033

手动压栈

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<cstring>
using namespace std;

struct Tree
{
    int data;
    Tree *left,*right;
};

Tree *Insert(Tree *head,int node)
{
    Tree *current_point,*parent_point;
    Tree *new_point;

    new_point=(Tree *)malloc(sizeof(Tree));
    new_point->data=node;
    new_point->left=NULL;
    new_point->right=NULL;

    if(head==NULL)
        return new_point;

    current_point=head;
    while(current_point!=NULL)
    {
        parent_point=current_point;

        current_point=(node>current_point->data)?current_point->right:current_point->left;
    }
    if(node>parent_point->data)
        parent_point->right=new_point;
    else
        parent_point->left=new_point;

    return head;
}

Tree *Create(int node[],int len)
{
    Tree *head=NULL;

    for(int i=1;i<=len;i++)
        head=Insert(head,node[i]);

    return head;
}

void print_01(Tree *node)//前序遍历
{
    printf("前序遍历\n");
    stack<Tree *>tree;

    if(node!=NULL)
        tree.push(node);

    while(!tree.empty())
    {
        node=tree.top();
        tree.pop();

        printf("%d ",node->data);

        if(node->right!=NULL)//如果存在右节点，先入栈；
            tree.push(node->right);
        if(node->left!=NULL)//根据栈先进后出的结构，要想先打印左子树，左子树进栈比存在同深度的右兄弟晚进即可先出；
            tree.push(node->left);
    }
    printf("\n");
}

void print_02(Tree *node)
{
    printf("中序遍历\n");
    stack<Tree *>tree;

    while(node!=NULL||!tree.empty())
    {
        if(node!=NULL)
        {
            tree.push(node);
            node=node->left;
        }
        else
        {
            node=tree.top();
            printf("%d ",node->data);
            tree.pop();
            node=node->right;
        }
    }
    printf("\n");
}

//后序遍历的顺序是（左右父），而前序遍历的顺序是（父左右），根据栈先进后出的结构，可以令开辟一块栈来存储，先让一个栈按照父右左（只需将前序遍历中 if(node->right!=NULL)  tree.push(node->right)语句放在if(node->left!=NULL) tree.push(node->left)语句后即可），将打印语句改为压入另一新栈即可，最后打印新栈中的数据；
void print_03(Tree *node)
{
    printf("后序遍历\n");
    stack<Tree*>tree;
    stack<Tree*>tree_rev;

    if(node!=NULL)
        tree.push(node);

    while(!tree.empty())
    {
        node=tree.top();
        tree.pop();

       tree_rev.push(node);

        if(node->left!=NULL)
            tree.push(node->left);
        if(node->right!=NULL)
            tree.push(node->right);
    }
    while(!tree_rev.empty())
    {
        printf("%d ",tree_rev.top()->data);
        tree_rev.pop();
    }
    printf("\n");
}

int main()
{
    Tree *head;
    int n;

    while(cin>>n)
    {
        if(n==0)
            break;
        int node[n+1];
        for(int i=1;i<=n;i++)
            cin>>node[i];

        head=Create(node,n);
        print_01(head);
        print_02(head);
        print_03(head);
    }
    return 0;
}