输入先序遍历序列: ABDFGC, 再输入中序遍历序列: BFDGAC,则 输出该二叉树的后序遍历序列: FGDBCA。
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef char ElementType;
typedef struct BiTNode{
ElementType data;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode,*BiTree;
BiTree CreatBinTree(char *pre,char*in,int n );
void postorder( BiTree T );
int main()
{
BiTree T;
char prelist[100];
char inlist[100];
int length;
scanf("%s",prelist);
scanf("%s",inlist);
length=strlen(prelist);
T=CreatBinTree(prelist,inlist, length);
postorder( T );
return 0;
}
void postorder( BiTree T )
{
if(T)
{
postorder(T->lchild);
postorder(T->rchild);
printf("%c",T->data);
}
}
BiTree CreatBinTree(char *pre,char*in,int n)
{
BiTree T;
int i;
if(n<=0) return NULL;
T=(BiTree)malloc(sizeof(BiTNode));
T->data=pre[0];
for(i=0;in[i]!=pre[0];i++);
T->lchild=CreatBinTree(pre+1, in, i);
T->rchild=CreatBinTree(pre+i+1, in+i+1, n-i-1);
return T;
}
已知后序序遍历序列和中序遍历序列建立二叉树。 例如
输入后序遍历序列: FGDBCA, 再输入中序遍历序列: BFDGAC,则 输出该二叉树的先序遍历序列: ABDFGC。
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef char ElementType;
typedef struct BiTNode{
ElementType data;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode,*BiTree;
BiTree CreatBinTree(char *post,char*in,int n);
void preorder( BiTree T );
int main()
{
BiTree T;
char postlist[100];
char inlist[100];
int length;
scanf("%s",postlist);
scanf("%s",inlist);
length=strlen(postlist);
T=CreatBinTree(postlist,inlist, length);
preorder( T );
return 0;
}
void preorder( BiTree T )
{
if(T)
{
printf("%c",T->data);
preorder(T->lchild);
preorder(T->rchild);
}
}
BiTree CreatBinTree(char *post,char*in,int n )
{
BiTree T;
int i;
if(n<=0) return NULL;
T=(BiTree)malloc(sizeof(BiTNode));
T->data=post[n-1];
for(i=0;in[i]!=post[n-1];i++);
T->lchild=CreatBinTree(post, in, i);
T->rchild=CreatBinTree(post+i+1, in+i+1, n-1-i);
return T;
}