test.cpp

这个是二叉排序树。能通过二叉树对一组数字进行排序。

#include"iostream.h"
#include"BiTree.h"
template<class T>
void Visit(T item)
{
	cout<<item<<" ";
}
void main()
{
	BiSearchTree<int> search;
	int a[]={4,5,7,2,1,9,8,11,3};
	int n=9;
	for(int i=0;i<9;i++)
		search.Insert(a[i]);
	cout<<"构造完成后："<<endl;
	cout<<"前序遍历序列为：";
	search.PreOrder(Visit);
	cout<<endl;
	cout<<"中序遍历序列为：";
	search.InOrder(Visit);
	cout<<endl;
	cout<<"后序遍历序列为：";
	search.PostOrder(Visit);
	cout<<endl;
	search.Delete(4);
	cout<<"前序遍历序列为：";
	search.PreOrder(Visit);
	cout<<endl;
}