example515.cpp.~1~

我们高校的数据结构与算法的教师讲义,适合想自学数据结构的朋友参考.

#include "Bst.h" // binary search tree operations
#include <iostream>
using namespace std;

void display(TreeItemType& anItem)
{
	cout<<anItem.getKey()<<' ';
}

int main()
{
   BinarySearchTree tree1; // empty trees



   tree1.searchTreeInsert(100);
   tree1.searchTreeInsert(30);
   tree1.searchTreeInsert(90);
   tree1.searchTreeInsert(20);
   tree1.searchTreeInsert(10);
   tree1.searchTreeInsert(70);
   tree1.searchTreeInsert(80);
   tree1.searchTreeInsert(50);
   tree1.searchTreeInsert(60);
   tree1.searchTreeInsert(40);
   //tree1.searchTreeInsert(100);
   //tree1.searchTreeInsert(100);
   //tree1.searchTreeInsert(100);
   tree1.inorderTraverse(display);
   cout<<"\n------------------------\n";
   tree1.searchTreeDelete(10);
   tree1.layerorderTraverse(display);
   return 0;
} // end main