二叉树构造-前序输入,后序,中序输出

#include<iostream>
#include<cstring>
using namespace std;
#define DataType char

typedef struct Node
{
    DataType data;
    struct Node* lchild;
    struct Node* rchild;
    struct Node* parent;
}BiNode,*BiTree;

//必须按照输的前序遍历方式输入
BiTree CreatBiTree(){
    DataType ch;
    BiTree T;
    cin>>ch;
    if(ch=='#') T=NULL;
    else{
        T=new BiNode;
        T->data=ch;
        T->lchild=CreatBiTree();
        T->rchild=CreatBiTree();
    }
    return T;
}

//中序遍历:左根右
void InOrder(BiTree T)
{
    if(T==NULL) return ;
    else
    {
        InOrder(T->lchild);
        cout<<T->data;
        InOrder(T->rchild);
    }
}

//后序遍历:左右根
void PostOrder(BiTree T)
{
    if(T==NULL) return ;
    else{
        PostOrder(T->lchild);
        PostOrder(T->rchild);
        cout<<T->data;
    }
}

int main()
{
    cout<<"请按要求输入一棵树:";
    BiTree T=CreatBiTree();
    cout<<"该树的后序遍历输出为:"<<endl;
    PostOrder(T);
     cout<<endl;
    cout<<"该树的中序遍历输出为:"<<endl;
    InOrder(T);
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_41110241/article/details/81077242