二叉树遍历.txt

该程序实现二叉树的遍历功能

#include<stdio.h>                    
#include<stdlib.h>
#include<malloc.h>
#include<conio.h>
#define NULL 0
typedef char elemtype;
typedef struct BiTNode
{
elemtype data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
BiTree T;
BiTree CreateBiTree()
{
BiTree T;
char ch;
scanf("%c",&ch);
if(ch==' ')  T=NULL;
else{
	T=(BiTNode *)malloc(sizeof(BiTNode));
	T->data=ch;
	T->lchild=CreateBiTree();
	T->rchild=CreateBiTree();
    }
return T;
}
void PreOrderTraverse(BiTree T)
{
if(T!=NULL)
{
	printf("%c\t",T->data);
	PreOrderTraverse(T->lchild);
	PreOrderTraverse(T->rchild);
}
}
void InOrderTraverse(BiTree T)
{
if(T!=NULL)
{
InOrderTraverse(T->lchild);
printf("%c\t",T->data);
InOrderTraverse(T->rchild);
}
}
void PostOrderTraverse(BiTree T)
{
if(T!=NULL)
{
PostOrderTraverse(T->lchild);
PostOrderTraverse(T->rchild);
printf("%c\t",T->data);
}
}
main()
{BiTree T;
   printf("CreateTree.\n");
 printf("***************\n");
 printf("Please input the char in order: \n");
T=CreateBiTree();getchar();
PreOrderTraverse(T);printf("end!ok!\n");
InOrderTraverse(T);printf("end!ok!\n");
PostOrderTraverse(T);printf("end!ok!\n");
printf("press any key to continue... ");
getchar();return;}