bisearchtree.cpp

来自「包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等」· C++ 代码 · 共 39 行

#include <iostream.h>
#include <stdlib.h>

#include "BiTreeNode.h"						//包含二叉树结点类
#include "BiSearchTree.h"					//包含二叉排序树类

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

void main(void)
{
	BiSearchTree<int> searchTree;
	int a[] = {4,5,7,2,1,9,8,11,3}, x = 9;
	int	n = 9;

	for(int i = 0; i < n; i++)
		searchTree.Insert(a[i]);			//插入构造二叉排序树

	cout  << "插入后：\n" << "前序遍历序列为：";
	searchTree.PreOrder(Visit);
	cout << "\n中序遍历序列为：";
	searchTree.InOrder(Visit);

	searchTree.Delete(4);			//删除结点4，这是删除的情况4

	cout << "\n删除后：\n" << "前序遍历序列为：";
	searchTree.PreOrder(Visit);
	cout << "\n中序遍历序列为：";
	searchTree.InOrder(Visit);

	if(searchTree.Find(x) != NULL)
		cout << "\n数据元素" << x << "存在！";
	else
		cout << "\n数据元素" << x << "不存在！";
}