新手

#include <iostream> 
using namespace std;
#include <queue>


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


void CreatBiTree(BiTree &T)//先序遍历的方式创建二叉树 
{
	char c;
	cin >> c;
	if (c == '0')
		T = NULL;
	else 
	{
		T = new node;
		T->data  = c;
		CreatBiTree(T->lchild );
		CreatBiTree(T->rchild );
	}
}

void PreOrderTraverse(BiTree T)//先序遍历输出 
{
	if (T != NULL)
	{
		cout << T->data << ' ';
		PreOrderTraverse(T->lchild );
		PreOrderTraverse(T->rchild );
	}
}


void InOrderTraverse(BiTree T)//中序遍历输出 
{
	if (T != NULL)
	{
		InOrderTraverse(T->lchild );	
		cout << T->data << ' ';
		InOrderTraverse(T->rchild );
	}
}

void PostOrderTraverse(BiTree T)//后序遍历输出 
{
	if (T != NULL)
	{
		PostOrderTraverse(T->lchild );
		PostOrderTraverse(T->rchild );
		cout << T->data << ' ';
	}
}


void LevelOrderTraverse(...