AVL树
AVL树是带有平衡条件的二叉查找树,最简单的定义为:一颗AVL树是其每个节点的左子树和右子树的高度最多相差1的二叉查找树。
C语言定义:
struct AvlNode;
typedef struct AvlNode *position;
typedef struct AvlNode *avlTree;
typedef int elementType;
struct AvlNode
{
elementType Element;
avlTree Left;
avlTree Right;
int Height;
};
破坏平衡的四种情况
在对AVL树进行删除或插入操作时,会破坏原来树的平衡,需要进行重新的平衡调整。出现不平衡的情况主要有以下四种:
(1) 对K节点的左儿子的左子树进行一次插入。
LL:LeftLeft,也称为”左左”。插入或删除一个节点后,根节点的左子树的左子树还有非空子节点,导致”根的左子树的高度”比”根的右子树的高度”大2,导致AVL树失去了平衡。
(2)对K节点的左儿子的右子树进行一次插入。
LR:LeftRight,也称为”左右”。插入或删除一个节点后,根节点的左子树的右子树还有非空子节点,导致”根的左子树的高度”比”根的右子树的高度”大2,导致AVL树失去了平衡。
(3) 对K节点的右儿子的左子树进行一次插入。
RL:RightLeft,称为”右左”。插入或删除一个节点后,根节点的右子树的左子树还有非空子节点,导致”根的右子树的高度”比”根的左子树的高度”大2,导致AVL树失去了平衡。
(4)对K节点的右儿子的右子树进行一次插入。
RR:RightRight,称为”右右”。插入或删除一个节点后,根节点的右子树的右子树还有非空子节点,导致”根的右子树的高度”比”根的左子树的高度”大2,导致AVL树失去了平衡。
情形1、4是节点K的镜像对称,2、3是K节点的镜像对称。
LL旋转
对于LL旋转,你可以这样理解为:LL旋转是围绕”失去平衡的AVL根节点”进行的,也就是节点k2;而且由于是LL情况,即左左情况,就用手抓着”左孩子,即k1”使劲摇。将k1变成根节点,k2变成k1的右子树,”k1的右子树”变成”k2的左子树”。
static position LLrotation(position K2)
{
position K1;
K1 = K2->Left;
K2->Left = K1->Right;
K1->Right = K2;
K2->Height = Max( Height(K2->Left), Height(K2->Right)) + 1;
K1->Height = Max(Height(K1->Left), K2->Height) +1;
return K1; // new root
}
RR旋转
RR旋转与LL旋转类似,都是在外边通过删除或插入使得其左右子树高度不平衡。LL与RR时镜像对称的。
static position RRrotation(position K2)
{
position K1;
K1 = K2 ->Right;
K2->Right = K1->Left;
K1 ->Left = K2;
K2->Height = Max( Height(K2->Right), Height(K2->Left)) + 1;
K1->Height = Max(Height(K1->Right), K2->Height) + 1;
return K1;
}
LR旋转
第一次旋转是围绕”k1”进行的”RR旋转”,第二次是围绕”k3”进行的”LL旋转”。
static position LRrotation(position K3)
{
K3->Left = RRrotation(K3->Left);
return LLrotation(K3);
}
RL旋转
RL是与LR的对称情况!RL恢复平衡的旋转方法如下:
static position RLrotation(position K1)
{
K3->Right =LLrotation(K1->Right);
return RRrotation(K1);
}
AVL树的基本操作
avlTree makeempty(avlTree T);
position Find(elementType x, avlTree T);
void preorder_avltree(avlTree T);//前序遍历树
void inorder_avltree(avlTree T); //中序遍历
void posterorder_avltree(avlTree T); //后续遍历
position findMax(avlTree T);
position findMin(avlTree T);
avlTree Insert(elementType x, avlTree T); //插入元素
avlTree Delete(elementType x, avlTree T); //删除元素
static int Height(position P);
具体实现:
position Find(elementType x, avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
if(x < T->Element)
Find(x, T->Left);
else
Find(x, T->Right);
return T;
}
avlTree makeempty(avlTree T)
{
if (T == NULL)
{
printf("tree is already empty!\n");
return NULL;
}
if (T->Left == NULL && T->Right == NULL)
{
free(T);
}
if(T->Left == NULL && T->Right != NULL)
{
makeempty(T->Right);
}
if(T->Right == NULL && T->Left != NULL)
{
makeempty(T->Left);
}
return T;
}
position findMax(avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
while (T->Right != NULL)
T = findMax(T->Right);
return T;
}
position findMin(avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
while (T->Left != NULL)
T = findMin(T->Left);
return T;
}
avlTree Delete(elementType x, avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
if (x < T->Element) //待删除节点在左子树
{
T->Left = Delete(x, T->Left);
//删除节点后,若树失去平衡,则进行相应的调整
if (Height(T->Right) - Height(T->Left) == 2) //节点的右子树比左子树高
{
if(Height(T->Right->Right) > Height(T->Right->Left))
RLrotation(T);
else
RRrotation(T);
}
}
else if (x > T->Element) //删除节点在右子树
{
T ->Right = Delete(x,T->Right);
if (Height(T->Left) - Height(T->Right) == 2)
{
if(Height(T->Left->Left) > Height(T->Left->Right))
LRrotation(T->Left);
else
LLrotation(T->Left);
}
}
else //T是对应要删除的节点
{
//节点的左右孩子非空
if (T->Left &&T->Right)
{
if (Height(T->Left) > Height(T->Right))
{
//如果T的左子树比右子树高,则找出T的左子树中的最大节点
//将该节点的值赋给T,删除最大节点
//即用T的左子树的最大节点做T的替身
position max = findMax(T->Left);
T->Element = max->Element;
T->Left = Delete(max->Element, T->Left);
}
else
{
//如果T的左子树不比右子树高(即它们相等或者右子树比左子树高
//则找出T的右子树的最小节点,将该节点的值赋给T,删除最小节点
//即用T的右子树最小节点替换T
position min = findMin(T->Right);
T->Element = min->Element;
T->Right = Delete(min->Element, T->Right);
}
}
else
{
position p = T;
T = T->Left ? T->Left : T->Right;
free(p);
}
}
return T;
}
void preorder_avltree(avlTree T) //前序遍历树
{
if (T != NULL)
{
printf("%d ", T->Element);
preorder_avltree(T->Left);
preorder_avltree(T->Right);
}
}
void inorder_avltree(avlTree T) //中序遍历
{
if(T != NULL)
{
inorder_avltree(T->Left);
printf("%d ", T->Element);
inorder_avltree(T->Right);
}
}
void posterorder_avltree(avlTree T) //后续遍历
{
if (T != NULL)
{
posterorder_avltree(T->Left);
posterorder_avltree(T->Right);
printf("%d ", T->Element);
}
}
测试范例
#include <stdio.h>
#include <stdlib.h>
struct AvlNode;
typedef struct AvlNode *position;
typedef struct AvlNode *avlTree;
typedef int elementType;
struct AvlNode
{
elementType Element;
avlTree Left;
avlTree Right;
int Height;
};
avlTree makeempty(avlTree T);
position Find(elementType x, avlTree T);
void preorder_avltree(avlTree T);//前序遍历树
void inorder_avltree(avlTree T); //中序遍历
void posterorder_avltree(avlTree T); //后续遍历
position findMax(avlTree T);
position findMin(avlTree T);
avlTree Insert(elementType x, avlTree T);
avlTree Delete(elementType x, avlTree T);
static int Height(position P);
static position LLrotation(position K2);
static position LRrotation(position K3);
static position RRrotation(position K2);
static position RLrotation(position K3);
static int Max(int a, int b);
int main()
{
int a[16] = {3,2,1,4,5,6,7,16,15,14,13,12,11,10,8,9};
avlTree tree = NULL;
for (int i = 0; i < 16; i++)
{
printf("%d ",a[i] );
tree = Insert(a[i], tree);
}
printf("\n");
printf("前序遍历:\n");
preorder_avltree(tree);
printf("\n中序遍历: \n");
inorder_avltree(tree);
printf("\n后序遍历: \n");
posterorder_avltree(tree);
printf("\n树的高度为:%d\n", Height(tree));
position max = findMax(tree);
printf("最大值:%d\n", max->Element);
position min = findMin(tree);
printf("最小值:%d\n", min->Element);
int x = 8;
printf("删除节点 %d \n", x);
tree = Delete(x, tree);
printf("中序遍历:\n");
inorder_avltree(tree);
makeempty(tree);
system("pause");
return 0;
}
static int Height(position P)
{
if( P == NULL)
return -1;
else
return P->Height;
}
static int Max(int a, int b)
{
return (a > b)? a : b;
}
avlTree Insert(elementType x, avlTree T)
{
if(T == NULL)
{
//create and return a one-node tree
T = (avlTree) malloc(sizeof (struct AvlNode));
if(T == NULL)
printf("out of space\n");
else
{
T->Element = x;
T->Height = 0;
T->Left = NULL;
T->Right = NULL;
}
}
else
{
if (x < T->Element)
{
T->Left = Insert(x, T->Left);
if(Height(T->Left) - Height(T->Right) == 2)
{if(x < T->Left->Element)
T = LLrotation(T);
else
T = LRrotation(T);}
}
else if(x > T->Element)
{
T->Right = Insert(x,T->Right);
if(Height(T->Right) - Height(T->Left) == 2)
{if(x > T->Right->Element)
T = RRrotation(T);
else T = RLrotation(T);}
}
}
//element is in the tree already, we'll do nothing
T->Height = Max(Height(T->Left), Height(T->Right)) + 1;
return T;
}
static position LLrotation(position K2)
{
position K1;
K1 = K2->Left;
K2->Left = K1->Right;
K1->Right = K2;
K2->Height = Max( Height(K2->Left), Height(K2->Right)) + 1;
K1->Height = Max(Height(K1->Left), K2->Height) +1;
return K1; // new root
}
static position LRrotation(position K3)
{
K3->Left = RRrotation(K3->Left);
return LLrotation(K3);
}
static position RRrotation(position K2)
{
position K1;
K1 = K2 ->Right;
K2->Right = K1->Left;
K1 ->Left = K2;
K2->Height = Max( Height(K2->Right), Height(K2->Left)) + 1;
K1->Height = Max(Height(K1->Right), K2->Height) + 1;
return K1;
}
static position RLrotation(position K3)
{
K3->Right =LLrotation(K3->Right);
return RRrotation(K3);
}
position Find(elementType x, avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
if(x < T->Element)
Find(x, T->Left);
else
Find(x, T->Right);
return T;
}
avlTree makeempty(avlTree T)
{
if (T == NULL)
{
printf("tree is already empty!\n");
return NULL;
}
if (T->Left == NULL && T->Right == NULL)
{
free(T);
}
if(T->Left == NULL && T->Right != NULL)
{
makeempty(T->Right);
}
if(T->Right == NULL && T->Left != NULL)
{
makeempty(T->Left);
}
return T;
}
position findMax(avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
while (T->Right != NULL)
T = findMax(T->Right);
return T;
}
position findMin(avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
while (T->Left != NULL)
T = findMin(T->Left);
return T;
}
avlTree Delete(elementType x, avlTree T)
{
if (T == NULL)
{
printf("tree is empty!\n");
return NULL;
}
if (x < T->Element) //待删除节点在左子树
{
T->Left = Delete(x, T->Left);
//删除节点后,若树失去平衡,则进行相应的调整
if (Height(T->Right) - Height(T->Left) == 2) //节点的右子树比左子树高
{
if(Height(T->Right->Right) > Height(T->Right->Left))
RLrotation(T);
else
RRrotation(T);
}
}
else if (x > T->Element) //删除节点在右子树
{
T ->Right = Delete(x,T->Right);
if (Height(T->Left) - Height(T->Right) == 2)
{
if(Height(T->Left->Left) > Height(T->Left->Right))
LRrotation(T->Left);
else
LLrotation(T->Left);
}
}
else //T是对应要删除的节点
{
//节点的左右孩子非空
if (T->Left &&T->Right)
{
if (Height(T->Left) > Height(T->Right))
{
//如果T的左子树比右子树高,则找出T的左子树中的最大节点
//将该节点的值赋给T,删除最大节点
//即用T的左子树的最大节点做T的替身
position max = findMax(T->Left);
T->Element = max->Element;
T->Left = Delete(max->Element, T->Left);
}
else
{
//如果T的左子树不比右子树高(即它们相等或者右子树比左子树高
//则找出T的右子树的最小节点,将该节点的值赋给T,删除最小节点
//即用T的右子树最小节点替换T
position min = findMin(T->Right);
T->Element = min->Element;
T->Right = Delete(min->Element, T->Right);
}
}
else
{
position p = T;
T = T->Left ? T->Left : T->Right;
free(p);
}
}
return T;
}
void preorder_avltree(avlTree T) //前序遍历树
{
if (T != NULL)
{
printf("%d ", T->Element);
preorder_avltree(T->Left);
preorder_avltree(T->Right);
}
}
void inorder_avltree(avlTree T) //中序遍历
{
if(T != NULL)
{
inorder_avltree(T->Left);
printf("%d ", T->Element);
inorder_avltree(T->Right);
}
}
void posterorder_avltree(avlTree T) //后续遍历
{
if (T != NULL)
{
posterorder_avltree(T->Left);
posterorder_avltree(T->Right);
printf("%d ", T->Element);
}
}
reference:http://www.cnblogs.com/skywang12345/p/3576969.html