妙趣横生的算法之二叉树的创建与遍历

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

typedef int ElemType; 

typedef struct node
{
	ElemType data;
	struct node *lchild;
	struct node *rchild;
}BitNode,*BitTree;


void CreateTree(BitTree *T)
{
	char c;
	scanf("%c",&c);
	if (c==' ')
	{
		*T = NULL;
	}
	else
	{
		*T = (BitNode *)malloc(sizeof(BitNode));
		(*T)->data = c;
		CreateTree(&((*T)->lchild));
		CreateTree(&((*T)->rchild));
	}
}
void Visit(char c)
{
	printf("%c",c);
}
void PreOrderTraverse(BitTree T)
{
	if (T)
	{
		Visit(T->data);
		PreOrderTraverse(T->lchild);
		PreOrderTraverse(T->rchild);
	}
}
void main()
{
	char c;
	BitTree tree;
	CreateTree(&tree);
	PreOrderTraverse(tree);
	getchar();

}