前序中序输出后序

最新推荐文章于 2023-04-19 22:51:42 发布

北里五井

最新推荐文章于 2023-04-19 22:51:42 发布

阅读量176

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/qq_37602930/article/details/80245778

版权

图论专栏收录该内容

24 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 100;
typedef struct BitNode{
 char Data;
 struct BitNode *Lchild,*rchild;
}BitNode,*Bittree;

char preArray[maxn];
char InArray[maxn];
void Createtree(Bittree &T, int prS, int prE, int inS, int inE)
{
    T = (Bittree)malloc(sizeof(BitNode));
    int Root;
    T ->Data = preArray[prS];
    for (int i = inS; i <= inE; i++)
    {
        if(T ->Data == InArray[i])
        {
            Root = i;
            break;
        }
    }
    if(Root != inS)
    {
        Createtree(T->Lchild,prS + 1,(Root - inS) + prS, inS, Root - 1);
    }
    else{
        T->Lchild = NULL;
    }

    if(Root != inE)
    {
        Createtree(T->rchild,(Root - inS) + prS+1,prE,Root + 1,inE);
    }
    else{
        T->rchild = NULL;
    }
}
void printorder(Bittree T)
{
    if(T->Lchild !=NULL)
    {
        printorder(T->Lchild);
    }
    if(T->rchild !=NULL)
    {
         printorder(T->rchild);
    }
    printf("%c",T->Data);
}
int main()
{
    while(scanf("%s", preArray) != EOF)
    {
        Bittree T;
        scanf("%s", InArray);
        Createtree(T,0,strlen(preArray) - 1,0,strlen(InArray) - 1);
        printorder(T);
        cout << endl;
    }
}