树的先序递归算法

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

typedef struct Tree{
	char Data;				//数据
	struct Tree * pLTREE;	//左指针
	struct Tree * pRTREE;	//右指针
} TREE, * PTREE;

PTREE createTree(void);

//树的先序排序.
void xianXu(PTREE);

void main(){
	PTREE A = createTree();

	xianXu(A);
}

//树的先序递归算法.
void xianXu(PTREE p){
	if(NULL != p){
		printf("%c \n", p->Data);
		xianXu(p->pLTREE);
		xianXu(p->pRTREE);
	}
}

//创建一个树.
PTREE createTree(){

	PTREE A = (PTREE)malloc(sizeof(TREE));
	PTREE B = (PTREE)malloc(sizeof(TREE));
	PTREE C = (PTREE)malloc(sizeof(TREE));
	PTREE D = (PTREE)malloc(sizeof(TREE));
	PTREE E = (PTREE)malloc(sizeof(TREE));

	A->Data = 'A';
	B->Data = 'B';
	C->Data = 'C';
	D->Data = 'D';
	E->Data = 'E';

	A->pLTREE = B;
	A->pRTREE = C;

	B->pLTREE = NULL;
	B->pRTREE = NULL;

	C->pLTREE = D;
	C->pRTREE = NULL;

	D->pLTREE = NULL;
	D->pRTREE = E;

	E->pLTREE = NULL;
	E->pRTREE = NULL;
	return A;
}