数据结构上机测试4.1:二叉树的遍历与应用1

PRoblem Description

Input

Output

Example Input

ABDCEFBDAECF
Example Output
DBEFCA
 
#include<stdio.h>#include<string.h>#include<stdlib.h>typedef struct node{    char data;    struct node *lc,*rc;}bitree;bitree * create(int hlen,char qst[51],char hst[51]){    int i;    bitree * t;    if(hlen<=0)        return NULL;    t=(bitree *)malloc(sizeof(bitree));    t->data=qst[0];    for(i=0;i<hlen;i++)    {        if(hst[i]==qst[0])            break;    }    t->lc=create(i,qst+1,hst);    t->rc=create(hlen-i-1,qst+i+1,hst+i+1);    return t;}void postshow(bitree * tree){    bitree * t;    t=tree;    if(t)    {        postshow(t->lc);        postshow(t->rc);        printf("%c",t->data);    }}int main(){    int hlen;    char qst[51],hst[51];    bitree * tree;    scanf("%s%s",qst,hst);    hlen=strlen(hst);    tree=create(hlen,qst,hst);    postshow(tree);    printf("/n");    return 0;}