先序创建二叉树与二叉树的三种遍历

#include<iostream>
#include<cstdio>
using namespace std;
#define TElemtype char
const int maxn=1e4+5;
char a[maxn];
typedef struct BiTNode{
	TElemtype data;
	struct BiTNode *lchild, *rchild;

}BiTNode, *BiTree;
BiTree CreateBiTree(BiTree &T)
{
    char ch;
	cin>>ch;
	if(ch=='#') T=NULL;
	else 
	{
		T=new BiTNode;
		T->data=ch;
		CreateBiTree(T->lchild);
		CreateBiTree(T->rchild);
	}
	return T;
}
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=NULL;
	T=CreateBiTree(T);

	cout<<"先序遍历:";
	PreOrder(T);
	cout<<endl;

	cout<<"中序遍历:";
	InOrder(T);
	cout<<endl;

	cout<<"后续遍历:";
	PostOrder(T);
	cout<<endl;

	return 0;
}
/*
abc##de#g##f###
p121
*/