二叉樹建樹與層次遍歷

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

void CreateBiTree(BiTree &T){
	char ch;
	scanf("%c",&ch);
	if(ch=='#'){
		T=NULL;
		return;
	}
	T=(BiTree)malloc(sizeof(BiTNode));
	T->data=ch;
	CreateBiTree(T->lchild);
	CreateBiTree(T->rchild);
}

void LevelOrder(BiTree T){
	InitQueue(Q);
	EnQueue(Q,T);
	BiTree p;
	while(!IsEmpty(Q)){
		DeQueue(Q,p);
		visit(p);
		if(p->lchild!=NULL)
			EnQueue(Q,p->lchild);
		if(p->rchild!=NULL)
			EnQueue(Q,p->rchild);
	}
}