1、用随机函数生成10个待排序元素；

// BiSearchTree.cpp : Defines the entry point for the console application. // #include "BiSearchTree.h" #include "stdlib.h" #include "time.h" typedef int Datatype; #define Max 10 void main(void) { BiSearchTree<int> searchTree; time_t t; srand((unsigned)time(&t)); for(int i=0;i<10;i++) searchTree.Insert(rand()%100); cout<<"下面输出中序遍历"<<endl; searchTree.InOrder(); cout<<endl; cout<<"下面输出降序遍历"<<endl; searchTree.myOrder(); cout<<endl; system("pause"); }