//建立二叉排序树并遍历
#include<stdio.h>
#include<string.h>
struct Node
{
Node *lchild;
Node *rchild;
int c;
}Tree[100];
int loc; //记录节点个数
Node *Create()
{
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(T==NULL)
{
T=Create();
T->c=x;
return T;
}
else if(T->c<x)
T->rchild=insert(T->rchild,x);
else if(T->c>x)
T->lchild=insert(T->lchild,x);
return T;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
loc=0;
Node *T=NULL;
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
T=insert(T,x);
}
printf("\n");
preOrder(T);printf("\n");
inOrder(T);printf("\n");
postOrder(T);printf("\n");
}
return 0;
}
二叉排序树
最新推荐文章于 2024-10-01 08:56:16 发布