二叉树先序、中序、后序、层次遍历（c++）

#include<iostream>
using namespace std;
#define MaxSize 100
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
typedef struct   //定义顺序队
{
	BiTree data[MaxSize];
	int front, rear;
}SqQueue;
void Ininqueue(SqQueue& Q)   //初始化队列
{
	Q.front = Q.rear = 0;
}
bool Isempty(SqQueue& Q)   //队列判空
{
	if (Q.front == Q.rear)
		return true;
	else
		return false;
}
bool EnQueue(SqQueue& Q, BiTree p)      //入队
{
	if ((Q.rear + 1) == Q.front % MaxSize)
		return false;
	else
		Q.data[Q.rear] = p;
	Q.rear = (Q.rear + 1) % MaxSize;
}
bool DeQueue(SqQueue& Q, BiTree& p)      //出队
{
	if (Q.rear == Q.front)
		return false;
	else
		p = Q.data[Q.front];
	Q.front = (Q.front + 1) % MaxSize;
}
void CreatBitree(BiTree& T, char s[], int& i)    //建立二叉链表
{
	if (s[i] == '0')
		T = NULL;
	else
	{
		T = new BiTNode;
		T->data = s[i];
		CreatBitree(T->lchild, s, ++i);
		CreatBitree(T->rchild, s, ++i);
	}
}
void LeverOrder(BiTree T)   //层次遍历
{
	SqQueue Q;
	Ininqueue(Q);
	BiTree p = T;
	EnQueue(Q, p);
	while (!Isempty(Q))
	{
		DeQueue(Q, p);
		cout << p->data;
		if (p->lchild != NULL)
			EnQueue(Q, p->lchild);
		if (p->rchild != NULL)
			EnQueue(Q, p->rchild);
	}
}
void PreOrder(BiTree T)    //先序遍历
{
	if (T)
	{
		cout << T->data;
		PreOrder(T->lchild);
		PreOrder(T->rchild);
	}
}
void InOrder(BiTree T)     //中序遍历
{
	if (T)
	{
		InOrder(T->lchild);
		cout << T->data;
		InOrder(T->rchild);
	}
}
void PostOrder(BiTree T)     //后序遍历
{
	if (T)
	{
		PostOrder(T->lchild);
		PostOrder(T->rchild);
		cout << T->data;
	}
}
int main()
{
	BiTree T;

	char s[200];
	while (cin >> s && s[0] != '0')
	{
		int i = -1;
		CreatBitree(T, s, ++i);
		PreOrder(T);
		cout << endl;
		InOrder(T);
		cout << endl;
		PostOrder(T);
		cout << endl;
		LeverOrder(T);
		cout << endl;
	}
	return 0;
}