二叉树的递归遍历（c语言）

#include<stdio.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
typedef char Elemtype;
typedef struct node
{
	Elemtype data;
	struct node *lchild,*rchild;
}*BiTree,Tree;
void createBiTree(BiTree *T)
{
	Elemtype ch;
	scanf("%c",&ch);
	if(ch=='#')
		*T=NULL;
	else
	{
		*T=(Tree *)malloc(sizeof(Tree));
		if(!T)
			exit(-1);
		(*T)->data=ch;
		createBiTree(&(*T)->lchild);
		createBiTree(&(*T)->rchild);
	}
}
void visit(Elemtype c,int level)//访问二叉树具体操作
{
	printf("%c位于第 %d 层\n",c,level);
}
void PreOrder(BiTree T,int level)//先序遍历二叉树
{
	
	if(T)
	{
		visit(T->data,level);
		PreOrder(T->lchild,level+1);
		PreOrder(T->rchild,level+1);
	}
                else
                         return ;
}
void InOrder(BiTree T,int level)//中序遍历二叉树
{
	
	if(T)
	{
		
		InOrder(T->lchild,level+1);
		visit(T->data,level);
		InOrder(T->rchild,level+1);
		
	}
}
void PostOrder(BiTree T,int level)//中序遍历二叉树
{
	
	if(T)
	{
		PostOrder(T->lchild,level+1);		
		PostOrder(T->rchild,level+1);
		visit(T->data,level);
		
	}
}
void main()
{
	BiTree T=NULL;
	int level=1;
	printf("请以先序遍历约定输入二叉树:\n");
	createBiTree(&T);
	printf("OK!\n");
	printf("前序遍历二叉树:\n");
	PreOrder(T,level);
	printf("中序遍历二叉树:\n");
	InOrder(T,level);
	printf("后序遍历二叉树:\n");
	PostOrder(T,level);
	printf("\n");
	
}