数据结构实验：二叉排序树的插入和删除算法

#include "Assistance.h" // 辅助软件包 #include "BinarySortTree.h" // 二叉排序树类 int main(void) { BinarySortTree<int> bt; //int elem[] = { 39, 68, 11, 23, 46, 34, 75, 86, 8, 71 }; int elem[] = { 23,9,87,94,53,17,65,81,78,72}; int n = 10; for (int i = 0; i < n; i++) bt.Insert(elem[i]); // 根据elem数组中的元素构造二叉排序树 cout << "原二叉排序树:" << endl; DisplayBTWithTreeShape(bt); cout << endl; system("PAUSE"); char c = 'x'; int x; while (c != '0') { cout << endl << "1. 插入元素."; cout << endl << "2. 删除元素."; cout << endl << "3. 中序遍历."; cout << endl << "4. 显示二叉排序树."; cout << endl << "0. 退出"; cout << endl << "选择功能(0~4):"; cin >> c; switch (c) { case '1': cout << endl << "输入插入元素的值:"; cin >> x; bt.Insert(x); break; case '2': cout << endl << "输入删除元素的值:"; cin >> x; bt.Delete(x); break; case '3': cout << endl; bt.InOrder(Write<int>); break; case '4': cout << endl; DisplayBTWithTreeShape(bt); break; } } system("PAUSE"); return 0; }