平衡二叉树(AVL)的插入和删除详解(下)

平衡二叉树(AVL)的插入和删除详解(上)：http://blog.csdn.net/sysu_arui/article/details/7897017

1、测试代码

为减小篇幅，只给出了主程序，其他函数模块请看(上)中的描述。

#include <cstdlib>
#include <iostream>
#include <string>

using namespace std;

int main(int argc, char *argv[])
{
	AVL t ;
	initAVL(t);
	bool taller = false;
	bool shorter = false;
	int key;
	string major;
	ElementType e;
	int choice = -1;
	bool flag = true;
	
	while(flag)
	{
		cout<<"--------------------"<<endl;
		cout<<"0. print"<<endl
			<<"1. insert"<<endl 
			<<"2. delete"<<endl
			<<"3. search"<<endl
			<<"4. exit"<<endl
			<<"--------------------"<<endl
			<<"please input your choice: ";
		cin>>choice;
		swi