二叉树创建

# include<stdio.h>
# include<malloc.h>
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*biTree;


void createtree(biTree *T)//创建树
{
char c;
int num = 0;
printf("plese input a char input " "endof \n");
scanf("%c",&c);
getchar();//抵消回车符若无则 在递归时scnaf有一次不会执行
printf("存入RTR\n");
if(c == 'E')
{
  
    *T = NULL;
printf("%d\n",num++);
}
else
{
*T = (BiTNode *)malloc(sizeof(BiTNode));
(*T)->data= c;
(*T)->lchild = NULL;
(*T)->rchild = NULL;
printf("存入%c\n",c);
createtree(&(*T)->lchild);
printf("右树\n");
createtree(&(*T)->rchild);
}

}


void visittree(char c ,int level)
{
if(c == 'D')
printf("%c is at %d\n",c,level);
}


void ordertree(biTree t,int level)
{

if (t == NULL)
{
return ;//用于没有叶子节点的终止访问
}
visittree(t->data,level);
ordertree(t->rchild,level+1);
ordertree(t->lchild,level+1);

}


int main(void)
{
biTree t=NULL;
int level=1;//确定所在层数
createtree(&t);
printf("test\n");
ordertree(t,level);
return 0;
}