先序遍历二叉树

#include<stdio.h>
#include<stdlib.h>
typedef struct BiTNode
{
 char data;
 struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void CreateBiTree(BiTree &T)
{
 char ch;
 ch=getchar();
 if(ch!='#')
 {
  if(!(T=(BiTNode*)malloc(sizeof(BiTNode))))
  {
   printf("ERROR");
   exit(0);
  }
 // T=(struct BiTNode*)malloc(sizeof(struct BiTNode));
  T->data=ch;
  CreateBiTree(T->lchild );
  CreateBiTree(T->rchild );
 }
 else T=NULL;
 //return *T;
}
void Preorder(BiTree T)
{
 if(T)
 {
  printf("%c",T->data );
  Preorder(T->lchild );
  Preorder(T->rchild );
 }
}
void main()
{
 BiTree T;
 printf("请输入先序遍历的二叉树序列(#号代表该结点为空)：如(ABC##DE#G##F###)\n");
 CreateBiTree(T);
 Preorder(T);
 printf("\n");
 //printf("%d\n",print(T));
}