第十一周项目1 验证算法2二叉树构造算法的验证

#include "btree.h"BTNode *CreateBT1(char *pre,char *in,int n){    BTNode *s;    char *p;    int k;    if (n<=0) return NULL;    s=(BTNode *)malloc(sizeof(BTNode));         s->data=*pre;    for (p=in; p<in+n; p++)                         if (*p==*pre)                                  break;                          

    k=p-in;                                    s->lchild=CreateBT1(pre+1,in,k);            s->rchild=CreateBT1(pre+k+1,p+1,n-k-1);     return s;}int main(){    ElemType pre[]="ABDGCEF",in[]="DGBAECF";    BTNode *b1;    b1=CreateBT1(pre,in,7);    printf("b1:");    DispBTNode(b1);    printf("\n");    return 0;}