二叉树的创建和前序遍历

#include<stdio.h>
#include<malloc.h>

typedef char ElemType;

typedef struct BiTNode
{
	ElemType data;
	struct BiTNode *lchild,*rchild;

}BiTNode,*BiTree;
//创建一个二叉树
//前序变历输入
void CreateBiTree(BiTree *T)
{
	char c;
	scanf("%c",&c);
	if( ' ' == c )
	{
		*T = NULL;
	}
	else
	{
		*T = (BiTNode *)malloc(sizeof(BiTNode));
		(*T)->data = c;
		CreateBiTree(&(*T)->lchild);
		CreateBiTree(&(*T)->rchild);
	}
}
void visit(ElemType data,int level)
{
	printf("%c   %d\n ",data,level);
}
//遍历二叉树
void PreOrderTraverse(BiTree T,int level)
{
	if(T)
	{
		visit(T->data,level);
		PreOrderTraverse(T->lchild,level+1);
		PreOrderTraverse(T->rchild,level+1);
	}

}
int main()
{
	int level = 1;
	BiTree T = NULL;

	CreateBiTree(&T);
	PreOrderTraverse(T,level);


	return 0;
}