AVL树的实现

#include"AVL_Tree.h"
#include<conio.h>
#include <iostream>
#include<deque>
using namespace std;

void aaa()
{
	AvlTree_ AVT;

	int ival[15] = { 2,3,4,5,6,7,8,9,10,14,15,16.22,23,33,66 };
	for (int i = 0; i != 15; i++)
		AVT.AvlTreeRoot = AVT.Insert(ival[i], AVT.AvlTreeRoot);
	AVT.PrintTree();

	int ival2[6] = { 0,33,66,9,15,22 };
	for (int i = 0; i != 6; i++)
		AVT.AvlTreeRoot = AVT.Delete(ival2[i], AVT.AvlTreeRoot);
	AVT.PrintTree();

	puts("插入15后!");
	AVT.AvlTreeRoot = AVT.Insert(15, AVT.AvlTreeRoot);
	AVT.PrintTree();
}

int main()
{
	aaa();
	cout << "\n\naaa";
	return _getch();
}

#include"AVL_Tree.h"
#include<iostream>
#include<deque>
#define ROOTNUM 1
using namespace std;

struct AvlNode
{
	ElemenType Element;
	AvlTree LC;
	AvlTree RC;
	int Height;
};

static int Max(int a, int b)
{
	if (a >= b)
		return a;
	return b;
}

static void ERROR(char*Str)
{
	cout << Str << endl;
	exit(1);
}

static int Height(Position P)
{
	if (P == NULL)
		return -1;
	return P->Height;
}

Position AvlTree_::FindMin(AvlTree T) {
	if (T == NULL)
		return NULL;
	else if (T->LC == NULL)
		return T;
	else
		return FindMin(T->LC);
}

static Position SingleRotateWithLeft(Position K2)
{
	Position K1;

	K1 = K2->LC;
	K2->LC = K1->RC;
	K1->RC = K2;

	K2->Height = Max(Height(K2->LC), Height(K2->RC)) + 1;
	K1->Height = Max(Height(K1->LC), K2->Height) + 1;

	return K1;
}

static Position SingleRotateWithRight(Position K2)
{
	Position K1;

	K1 = K2->RC;
	K2->RC = K1->LC;
	K1->LC = K2;

	K2->Height = Max(Height(K2->LC), Height(K2->RC)) + 1;
	K1->Height = Max(Height(K1->LC), Height(K1->RC)) + 1;

	return K1;
}

static Position DoubleRotateWithLeft(Position K3)
{
	K3->LC = SingleRotateWithRight(K3->LC);

	return SingleRotateWithLeft(K3);
}

static Position DoubleRotateWithRight(Position K3)
{
	K3->RC = SingleRotateWithLeft(K3->RC);

	return SingleRotateWithRight(K3);
}

static void TravelRelease(AvlTree T)
{
	if (T == NULL)
		return;
	TravelRelease(T->LC);
	TravelRelease(T->RC);
	cout << T->Element;
	delete T, T = NULL; 
	cout<< "'ve ~ed,  ";
}

AvlTree_::AvlTree_()
{
    AvlTreeRoot = new struct AvlNode;
	if (AvlTreeRoot == NULL)
		ERROR("Out of space by new T!");
	else
	{
		AvlTreeRoot = NULL;
		AvlTreeRoot = Insert(ROOTNUM, AvlTreeRoot);
	}
}

AvlTree_::~AvlTree_()
{
	TravelRelease(AvlTreeRoot);
}

AvlTree AvlTree_::Insert(ElemenType E, AvlTree T)
{
	if (T == NULL)
	{
		T = new struct AvlNode;
		if (T == NULL)
			ERROR("Out of space by new T!");
		else
		{
			T->Element = E;
			T->LC = T->RC = NULL;
			T->Height = 0;
		}
	}
	else if (E < T->Element)
	{
		T->LC = Insert(E, T->LC);
		if (Height(T->LC) - Height(T->RC) == 2)
		{
			if (E < T->LC->Element)
				T = SingleRotateWithLeft(T);
			else
				T = DoubleRotateWithLeft(T);
		}
	}
	else if (E>T->Element)
	{
		T->RC = Insert(E, T->RC);
		if (Height(T->RC) - Height(T->LC) == 2)
		{
			if (E > T->RC->Element)
				T = SingleRotateWithRight(T);
			else
				T = DoubleRotateWithRight(T);
		}
	}
	/*else E is in the Tree already;do nothing*/
	T->Height = Max(Height(T->LC), Height(T->RC)) + 1;

	return T;
}

AvlTree AvlTree_::Delete(ElemenType E, AvlTree T)
{
	if (T == NULL)
		cout << "Not find the Elemente --->"<<E<<endl;
	else if (E < T->Element)
	{
		T->LC = Delete(E, T->LC);
		T->Height = Max(Height(T->RC),Height(T->LC)) + 1;		//完事后调整高度
		if (Height(T->LC) - Height(T->RC) == -2)//右边更高
		{
			if (T->RC->RC>T->RC->LC)
				T = SingleRotateWithRight(T);
			else
				T = DoubleRotateWithRight(T);
		}
	}
	else if (E > T->Element)
	{
		T->RC = Delete(E, T->RC);
		T->Height = Max(Height(T->RC), Height(T->LC)) + 1;
		if (Height(T->RC) - Height(T->LC) == -2)//左边更高
		{
			if (T->LC->LC > T->LC->RC)
				T = SingleRotateWithLeft(T);
			else
				T = DoubleRotateWithLeft(T);
		}
	}
	else
	{	//----找到并删除,
		if (T->LC&&T->RC)
		{//----E==T->Element,待删除点(数据结构与应用C语言第二版Page77页图示);  
			Position TmpMinP = FindMin(T->RC);
			T->Element = TmpMinP->Element;
			T->RC = Delete(T->Element, T->RC);
			T->Height = Max(Height(T->RC), Height(T->LC)) + 1;
		}
		else
		{//----单孩子或者无孩子的情况;  
			Position TmpP = T;
			if (T->LC == NULL)
				T = T->RC;
			else if (T->RC == NULL)
				T = T->LC;
			delete TmpP, TmpP = NULL;
		}
	}

	return T;
}

void AvlTree_::PrintTree()
{
	deque<AvlTree> AvlQueue[10];

	printf("每层元素,[高度]依次是:  \n");
	AvlQueue[0].push_back(AvlTreeRoot);
	for (int i = 0; i != 7; i++)
	{
		while (!AvlQueue[i].empty())
		{
			AvlTree T = NULL;

			T = AvlQueue[i].front(), AvlQueue[i].pop_front();
			printf("%d,[%d]  ", T->Element,T->Height);
			if (T->LC != NULL)		AvlQueue[i+1].push_back(T->LC);
			if (T->RC != NULL)		AvlQueue[i+1].push_back(T->RC);
		}
		putchar('\n');
	}
}

#ifndef AVL_Tree_H
#define AVL_Tree_H
typedef  int ElemenType;
struct AvlNode;
typedef struct AvlNode *Position;
typedef Position AvlTree;

class AvlTree_
{
public:
	AvlTree_();
	~AvlTree_();
	//Position Find();
	Position FindMin(AvlTree);
	//Position FindMax();
	AvlTree Insert(ElemenType, AvlTree);
	AvlTree Delete(ElemenType, AvlTree);//----return deleted.
	void PrintTree();
//private:
	AvlTree AvlTreeRoot;
};

#endif // !AVL_Tree_H