선순 서열 과 중 순 서열 로 이 진 트 리 를 생 성 합 니 다.

#include
#include
#include

typedef struct BiTNode{
    char e;
    struct BiTNode *lchild,*rchild;
}BiTNode;

void preOrderTravse(BiTNode *T1){
    if(T1){
        printf("%c",T1->e);
        preOrderTravse(T1->lchild);
        preOrderTravse(T1->rchild);
    }
}
void inOrderTravse(BiTNode *T1){
    if(T1){
        inOrderTravse(T1->lchild);
        printf("%c",T1->e);
        inOrderTravse(T1->rchild);
    }
}
void postOrderTravse(BiTNode *T1){
    if(T1){
        postOrderTravse(T1->lchild);
        postOrderTravse(T1->rchild);
        printf("%c",T1->e);
    }
}
int CreateBiTree(BiTNode **T1,char *preString,char *inString,int start,int end){
    if(start==end){
        *T1=NULL;
    }
    else{
        *T1=(BiTNode*)malloc(sizeof(BiTNode));
        int middle=start;
        while(inString[middle]!=*preString) middle++;
        (*T1)->e=*preString;
        preString++;
        CreateBiTree(&((*T1)->lchild),preString,inString,start,middle);
        preString+=middle-start;        //       ：   middle，   middle-start!
        CreateBiTree(&((*T1)->rchild),preString,inString,middle+1,end);
    }
    return 1;
}
int main(){
    /*
    char preString[]="ABECDFGHIJ",inString[]="EBCDAFHIGJ";
    */
    //      ：
    char *preString,*inString;
    char pre[50],in[50];
    preString=pre;
    inString=in;
    printf("       ：");
    gets(preString);
    printf("       ：");
    gets(inString);
    //
    int start=0,end=0;
    end=strlen(preString);      //start、end    inString       
    BiTNode *T1;
    CreateBiTree(&T1,preString,inString,start,end);
    preOrderTravse(T1);
    printf("
");
    inOrderTravse(T1);
    printf("
");
    postOrderTravse(T1);
    return 0;
}