AVL树特性:
在满足二叉查找树的特性上,还要满足左右子树深度之差绝对值不大于1。
我们定义平衡因子(BF):
该结点的左子树深度减去它的右子树的深度,则平衡二叉树上所有结点的深度只可能是-1,0或1。
构造方法:
插入过程中,采用平衡旋转技术获得。
一般来说,插入新结点后导致某一个结点的平衡因子绝对值大于1,失去平衡后进行调整的规律有以下四种情况:
- 单向右旋平衡处理:(a)
- 单向左旋平衡处理:©
- 双向旋转(先左后右)平衡处理:(b)(旋转两次)
- 双向旋转(先右后左)平衡处理:(d)
删除的算法类似,建议图图画好,分别讨论好每种对应的情况,不要遗漏。
- hpp
//
// AVLtree.hpp
// AVLTree
//
// Created by peiyu wang on 2019/3/21.
// Copyright © 2019 peiyu wang. All rights reserved.
//
#ifndef AVLtree_hpp
#define AVLtree_hpp
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
/*宏定义*/
#define LH 1
#define EH 0
#define RH -1
typedef int KeyType;
struct AVLNode
{
KeyType data;
int bf;// 平衡因子
AVLNode *lchild;
AVLNode *rchild;
};
typedef AVLNode* AVLTree;
// 创建AVL树
int CreateAVL(AVLTree &T);
// 查找并返回指向key的指针,不存在则返回NULL
AVLTree SearchAVL(AVLTree T, KeyType key);
//插入
int InsertAVL(AVLTree &T, KeyType key, bool &taller);
// 删除
int DeleteFuc(AVLTree &T, KeyType key, AVLTree f, AVLTree p, bool &taller, int mark);
int DeleteAVL(AVLTree &T, KeyType key);
// 右平衡处理
void RightBalance(AVLTree &T);
// 左平衡处理
void LeftBalance(AVLTree &T);
// 右旋
void R_Rotate(AVLTree &p);
// 左旋
void L_Rotate(AVLTree &p);
// 中序遍历
void InOrderTraverse(AVLTree T);
// 求树的结点数
int NodeNum(AVLTree T);
// 求树的深度
int AVLDepth(AVLTree T);
// 打印树
void PrintAVLTree(AVLTree T);
#endif /* AVLtree_hpp */
- cpp
//
// AVLtree.cpp
// AVLTree
//
// Created by peiyu wang on 2019/3/21.
// Copyright © 2019 peiyu wang. All rights reserved.
//
#include "AVLtree.hpp"
#include <vector>
#include <cmath>
int CreateAVL(AVLTree &T)
{
int N = 0;
bool t = false;
vector<KeyType> keys;
cout << "输入你想要组成查找表中元素的个数(上限为100):" << endl;
cin.clear();//重置错误输入
cin.sync();//清空缓冲区
cin >> N;
cout << "----------------" << endl;
cout << "输入你想要组成查找表中的元素:" << endl;
cout << "----------------" << endl;
for (int i = 0; i < N; i++)
{
KeyType key;
cin.clear();//重置错误输入
cin.sync();//清空缓冲区
cin >> key;
keys.push_back(key);
}
for (int i = 0; i < keys.size(); i++)
{
//cout << "123" << endl;
InsertAVL(T, keys[i], t);
}
return true;
}
// 查找并返回指向key的指针,不存在则返回NULL
AVLTree SearchAVL(AVLTree T, KeyType key)
{
if (!T || T->data == key)
return T;
else if (T->data > key)
return SearchAVL(T->lchild, key);
else
return SearchAVL(T->rchild, key);
}
//插入
int InsertAVL(AVLTree &T, KeyType key, bool &taller)
{
if (!T)
{
T = new AVLNode;
T->data = key;
T->lchild = T->rchild = NULL;
T->bf = EH;
taller = true;
}
else
{
if (T->data == key)
{
taller = false;
return false;
}
else if (T->data > key)
{
if (!InsertAVL(T->lchild, key, taller))
{
return false;
}
if (taller)
{
switch (T->bf) {
case LH:
LeftBalance(T);
taller = false;
break;
case EH:
T->bf = LH;
taller = true;
break;
case RH:
T->bf = EH;
taller = false;
break;
default:
break;
}
}
}
else
{
if (!InsertAVL(T->rchild, key, taller))
{
return false;
}
if (taller)
{
switch (T->bf) {
case LH:
T->bf = EH;
taller = false;
break;
case EH:
T->bf = RH;
taller = true;
break;
case RH:
RightBalance(T);
taller = false;
break;
default:
break;
}
}
}
}
return true;
}
// 删除
int DeleteFuc(AVLTree &T, KeyType key, AVLTree f, AVLTree p, bool &taller, int mark)
// p指向当前结点,f指向p的父结点,mark代表f与p的关系,用来代表p是f的左子树还是右子树,如果为0则为左,初始化为0
{
AVLTree r;
KeyType tmp;
if (!p)
return false;
else
{
if (key < p->data)
{
if (!DeleteFuc(T, key, p, p->lchild, taller, 0))
return false;
if (taller)
{
switch (p->bf) {
case LH:
p->bf = EH;
taller = true;
break;
case RH:
// 分开讨论不能都用p的原因是T是引用&传参,可以通过形参引用改变实参的值。
if (!f)
{
RightBalance(T);
}
else
{
RightBalance(p); // 删除p效果一样
}
taller = true;
break;
case EH:
p->bf = RH;
taller = false;
break;
default:
break;
}
}
}
else if (key > p->data)
{
if (!DeleteFuc(T, key, p, p->rchild, taller, 1))
return false;
if (taller)
{
switch (p->bf) {
case RH:
p->bf = EH;
taller = true;
break;
case LH:
if (!f)
{
LeftBalance(T);
}
else
{
LeftBalance(p);
}
taller = true;
break;
case EH:
p->bf = LH;
taller = true;
break;
default:
break;
}
}
}
else
{
if (p->rchild == NULL)
{
if (!f)
{
T = p->lchild;
}
else
{
if (mark == 0)
{
f->lchild = p->lchild;
}
else
{
f->rchild = p->lchild;
}
}
delete p;
p = NULL;
taller = true;
}
else if (p->lchild == NULL)
{
if (!f)
{
T = p->rchild;
}
else
{
if (mark == 0)
{
f->lchild = p->rchild;
}
else
{
f->rchild = p->rchild;
}
}
delete p;
p = NULL;
taller = true;
}
else
{
r = p->lchild;
while (r->rchild)
{
r = r->rchild;
}
tmp = r->data;
taller = false;
DeleteFuc(p, tmp, NULL, p, taller, 0);
p->data = tmp;
}
}
return true;
}
}
// 右平衡处理
void RightBalance(AVLTree &T)
{
AVLTree rc, ld;
rc = T->rchild;
switch (rc->bf) {
case RH:
rc->bf =EH;
T->bf = EH;
L_Rotate(T);
break;
case LH:
ld = rc->lchild;
switch (ld->bf) {
case LH:
ld->bf = T->bf = EH;
rc->bf = RH;
break;
case RH:
T->bf = LH;
ld->bf = rc->bf = EH;
break;
case EH:
T->bf = ld->bf = rc->bf = EH;
break;
default:
break;
}
R_Rotate(T->rchild);
L_Rotate(T);
break;
default:
break;
}
}
// 左平衡处理
void LeftBalance(AVLTree &T)
{
AVLTree lc, rd;
lc = T->lchild;
switch (lc->bf) {
case LH:
T->bf = lc->bf = EH;
R_Rotate(T);
break;
case RH:
rd = lc->rchild;
switch (rd->bf) {
case LH:
T->bf = RH;
rd->bf = lc->bf = EH;
break;
case RH:
rd->bf = T->bf = EH;
lc->bf = LH;
break;
// 感觉不会出现这种情况
case EH:
rd->bf = T->bf = lc->bf = EH;
break;
default:
break;
}
L_Rotate(T->lchild);
R_Rotate(T);
break;
default:
break;
}
}
int DeleteAVL(AVLTree &T, KeyType key)
{
bool taller = false;
return DeleteFuc(T, key, NULL, T, taller, 0);
}
// 右旋
void R_Rotate(AVLTree &p)
{
AVLTree q;
q = p->lchild;
p->lchild = q->rchild;
q->rchild = p;
p = q;
}
// 左旋
void L_Rotate(AVLTree &p)
{
AVLTree q;
q = p->rchild;
p->rchild = q->lchild;
q->lchild=p;
p = q;
}
// 中序遍历
void InOrderTraverse(AVLTree T)
{
if (!T)
return;
InOrderTraverse(T->lchild);
cout << T->data << endl;
InOrderTraverse(T->rchild);
}
// 求树的深度
int AVLDepth(AVLTree T)
{
if (!T)
return 0;
int ld = AVLDepth(T->lchild);
int rd = AVLDepth(T->rchild);
return ld > rd ? ld + 1 : rd + 1;
}
//求树的结点数
int NodeNum(AVLTree T)
{
if (!T)
return 0;
return 1 + NodeNum(T->lchild) + NodeNum(T->rchild);
}
// 打印树
void PrintAVLTree(AVLTree T)
{
int row, col;
int i, j, m, l, r;
AVLNode a[100][100] = {};
if (T)
{
row = AVLDepth(T);
col = pow(2, row) - 1;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= pow(2, i-1); j++)
{
m = (2*j-1)*pow(2, row-i);
l = (4*j-3)*pow(2, row-i-1);
r = (4*j-1)*pow(2, row-i-1);
if (i == 1)
a[i][m] = *T;
if (a[i][m].lchild)
a[i+1][l] = *(a[i][m].lchild);
if (a[i][m].rchild)
a[i+1][r] = *(a[i][m].rchild);
}
}
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
if (a[i][j].data)
{
printf("%2d", a[i][j].data);
}
else
{
printf(" ");
}
}
printf("\n");
}
}
}
- main
//
// main.cpp
// AVLTree
//
// Created by peiyu wang on 2019/3/21.
// Copyright © 2019 peiyu wang. All rights reserved.
//
#include "AVLtree.hpp"
int main(int argc, const char * argv[]) {
AVLTree T = NULL; //很重要,不然可能存在野指针。
CreateAVL(T);
InOrderTraverse(T);
cout << "------------" << endl;
PrintAVLTree(T);
cout << "------------" << endl;
cout << "Search key = 1" << endl;
SearchAVL(T, 1) == NULL ? cout << "No" << endl : cout << "Yes" << endl;
cout << "Delete key = 7" << endl;
DeleteAVL(T, 7);
//InOrderTraverse(T);
PrintAVLTree(T);
return 0;
}
- 实现效果: