C语言实现二叉树的创建、插入、删除、遍历等操作

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef int   ElemType; 
typedef struct BiTNode
{
ElemType   data; 
struct BiTNode*lChild, *rChlid;
}BiTNode, *BiTree;
int CreateBiTree(BiTree *T)
{
ElemType ch;
ElemType temp;
scanf("%d", &ch);
temp = getchar();
if (ch == -1)
*T = NULL;
else
{
*T = (BiTree)malloc(sizeof(BiTNode));
if (!(*T))
exit(-1);
(*T)->data = ch;
printf("输入%d的左子节点：", ch);
CreateBiTree(&(*T)->lChild);
printf("输入%d的右子节点：", ch);
CreateBiTree(&(*T)->rChlid);
}
return 1;
}