struct node {
int v, height;//v为结点权值,height为当前子树高度
node *lchild, *rchild;//左右孩子结点地址
};
生成一个新结点,v为结点权值
//生成一个新结点,v为结点权值
node *newNode(int v)
{
node* Node = new node;
Node->v = v;
Node->height = 1;//结点高度初始为1
Node->lchild = Node->rchild = NULL;
return Node;
}
//获取以root为根结点的子树的当前height
//获取以root为根结点的子树的当前height
int getHeight(node* root)
{
if(root == NULL)
{
return 0;
}
return root->height;
}
计算结点root的平衡因子
//计算结点root的平衡因子
int getBalanceFactor(node* root)
{
return getHeight(root->lchild) - getHeight(root->rchild);
}
更新结点root的height
//更新结点root的height
void updateHeight(node* root)
{
root->height = max(getHeight(root->lchild), getHeight(root->rchild)) + 1;
}
search 函数查找AVL树中数据域为x的结点
//search 函数查找AVL树中数据域为x的结点
void search(node* root, int x)
{
if (root == NULL)
{
puts("Serach failed!");
}
if (x == root->data)
{
printf("%d\n", root->data);
}
else if (x < root-data)
{
search(root->lchild, x);
}
else
{
search(root->rchild, x);
}
}
左旋(Left Rotation)
//左旋(Left Rotation)
void L(node* &root)
{
node* temp = root->rchild;
root->rchild = temp->lchild;
temp->lchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
右旋(Right Rotation)
//右旋(Right Rotation)
void R(node* &root)
{
node* temp = root->lchild;
root->lchild = temp->rchild;
temp->rchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
AVL树插入情况
插入权值为v的结点
//插入权值为v的结点
void insert(node* &root, int v)
{
if (root == NULL)
{
root = newNode(v);
}
if (v < root->v)
{
insert(root->lchild, v)
updateHeight(root);
if (getBalanceFactor(root) == 2)
{
if (getBalanceFactor(root->1child) == 1)
{
R(root);
}
else if (getBalanceFactor(root->1child) == -1)
{
L(root->lchild);
R(root);
}
}
}
else
{
insert(root->rchild, v)
updateHeight(root);
if (getBalanceFactor(root) == -2)
{
if (getBalanceFactor(root->rchild) == -1)
{
L(root);
}
else if (getBalanceFactor(root->rchild) == 1)
{
R(root->rchild);
L(root);
}
}
}
}
AVL树的建立
//AVL树的建立
node* Creat(int data[], int n)
{
node* root = NULL;
for (int i = 0; i < n; i++)
{
insert(root, data[i]);
}
return root;
}