二叉排序树

进行中序排序，结果是递增序列，

前序排序，跟输入一样

 

#include<iostream>
using namespace std;

struct Node //二叉树结构体
{
Node*lchild;
Node*rchild;
int 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);
}
cout << T->c<<" ";
}

void inOrder(Node*T)
{
if (T->lchild != NULL)
{
inOrder(T->lchild);
}
cout << T->c << " ";
if (T->rchild != NULL)
{
inOrder(T->rchild);
}

}

void preOrder(Node*T)
{
cout << 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 = 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 (cin >> n)
{
loc = 0;
Node*T = NULL;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
T = insert(T, x);
}
preOrder(T);
cout<< endl;
inOrder(T);
cout << endl;
postOrder(T);
cout << endl;
}
}