二叉排序树

#include<stdio.h>
//#include<string.h>


struct node{
node *lchild;
node *rchild;
char c;
} Tree[110];


int loc;
node *creat(){
Tree[loc].lchild=Tree[loc].rchild=NULL;
return &Tree[loc++];
}


void postOrder(node *T){
if(T->lchild!=NULL){
postOrder(T->lchild );
}
if(T->rchild !=NULL){
postOrder(T->rchild );
}
printf("%d ",T->c);
}


void inOrder(node *T){
if(T->lchild !=NULL)
{
inOrder(T->lchild );
}
printf("%d ",T->c );
if(T->rchild!=NULL)
{
inOrder (T->rchild );
}
}


void preOrder(node *T){
printf("%d ",T->c );
if(T->lchild !=NULL)
{
preOrder (T->lchild);
}
if(T->rchild !=NULL)
{
preOrder (T->rchild);
}
}


node *insert(node *T ,int x){
if(NULL==T){
T=creat();
T->c =x;
return T;
}else if(x<T->c )
{
T->lchild =insert(T->lchild ,x);
}else if(x>T->c){
T->rchild =insert(T->rchild,x);
}
return T;
}


int main(){
int n;


while(scanf("%d",&n)!=EOF){
node *T=NULL;
loc=0;
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
T=insert(T,x);
}
preOrder(T);
printf("\n");
inOrder(T);
printf("\n");
postOrder(T);
printf("\n");
}
return 0;
}