bisearchtreetest.cpp

来自「数据结构c++-书的一些源代码」· C++ 代码 · 共 25 行

#include "BiSearchTree.h"

template <class T>
void Visit(T item)
{
	cout << item << "   ";
}

void main(void)
{
	BiSearchTree<int> searchTree;
	int a[] = {10,7,6,9,20,12,22}, n = 7;
	for(int i = 0; i < n; i++)
		searchTree.Insert(a[i]);
	searchTree.InOrder(Visit);

	searchTree.Insert(8);
	cout << endl;
	searchTree.InOrder(Visit);

	searchTree.Delete(7);
	cout << endl;
	searchTree.InOrder(Visit);
}