二叉树的层序、先序、中序、后序遍历

#include <stdio.h>
#include <process.h>
#include <malloc.h>

#define OK 1
#define TRUE 1
#define FALSE 0
#define ERROR 0
#define OVERFLOW -2

typedef int Status;
typedef char  TElemType;

typedef struct BiTNode {
TElemType   data;
struct BiTNode  *lchild,*rchild;
}BiTNode,*BiTree;

typedef  BiTree  QElemType;

typedef struct QNode {
QElemType    data;
struct QNode  *next;
}QNode,*QueuePtr;

typedef struct {
QueuePtr front;
    QueuePtr rear;
}LinkQueue;
 

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);
CreateBiTree(T->rchild);
}
return  OK;
}

Status PrintElement(TElemType e){
printf("%c",e);
return OK;
}

Status PreOrderTraverse(BiTree T,Status(*Visit)(TElemType e)) {
if(T) {
if(Visit(T->data))
if(PreOrderTraverse(T->lchild,Visit))
if(PreOrderTraverse(T->rchild,Visit)) return OK;
return ERROR;
}
else return OK;
}

Status InOrderTraverse(BiTree T,Status(*Visit)(TElemType e)) {
if(T) {