求助!!关于建立二叉树的,帮忙改一下!!
#include<stdio.h>#include<malloc.h>
#define OverFlow 0
#define Null 0
typedef struct BitNode
{
int data;
struct BitNode *lchild,*rchild;
} BitNode;
int Create BiTree (BitNode*T)
{
char ch;
scanf("%",&ch);
if(ch==' ') T=Null;
if(!(T=(BitNode *) malloc (sizeof(BitNode )))
exit overflow;
T->data=ch;
createbitree(T->lchild);
createbitree(T->rchild);
return 1;
}
main()
{
bitnode T; int i;
i=create bitree(T);
if(i==1) printf("...");
else printf( "i");
}