C++ STL 数据结构 树

#include <iostream> #include "AVLTree.h" #include "algorithm_bt.h" using namespace std; void main() { cout<<"\t\tAVL Tree\n"; cout<<"This is a project showing the AVL Tree(balanced binary search tree):"<<endl; int array[]={1,2,3,4,5,6,7,8,9,10}; int len=sizeof(array)/sizeof(int); AVLTree<int> tree; for(int i=0;i<len;i++) tree.Insert(array[i]); BTDisplay(tree.Root()); AVLTree<int>::Iterator ir; cout<<"\nremove the number 9,.....\n"; ir=tree.find(9); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 8,.....\n"; ir=tree.find(8); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 6,.....\n"; ir=tree.find(6); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 4,.....\n"; ir=tree.find(4); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 1,.....\n"; ir=tree.find(1); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 2,.....\n"; ir=tree.find(2); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\nremove the number 3,.....\n"; ir=tree.find(3); tree.erase(ir); BTDisplay(tree.Root()); cout<<"\n\n\t\tEND"<<endl; }