递归简直太难了啊
#include<stdio.h>
#include<malloc.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FLASE 0
#define OVERFLOW 2
typedef int Status;
#define TElemType char
typedef struct BiTNode{
TElemType data;
struct BiTNode * lchild, * rchild; //左右孩子指针
}BiTNode, * BiTree;
Status CreateBiTree(BiTree &T)
{//先序建立二叉树
char ch;
scanf("%c", &ch);
if(ch==' ')
T=NULL;
else
{
if(!(T=(BiTNode *)malloc(sizeof(BiTNode))))
exit(OVERFLOW);
T->data=ch;
CreateBiTree(T->lchild); //构造左子树
CreateBi