AVL树基本操作
struct node
{
int v, h;
node *lchild, *rchild;
};
node* newNode(int x)
{
node* root = new node;
root->v = x;
root->h = 1;
root->lchild = root->rchild = NULL;
return root;
}
int getHeight(node* root)
{
if (root == NULL)
return 0;
return root->h;
}
void updateHeight(node* root)
{
root->h = max(getHeight(root->lchild), getHeight(root->rchild)) + 1;
}
int getBalanceFactor(node* root)
{
return getHeight(root->lchild) - getHeight(root->rchild);
}
void L(node* &root)
{
node* temp = root->rchild;
root->rchild = temp->lchild;
temp->lchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
void R(node* &root)
{
node* temp = root->lchild;
root->lchild = temp->rchild;
temp->rchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
void insert(node* &root, int x)
{
if (root == NULL)
{
root = newNode(x);
return;
}
if (x > root->v)
{
insert(root->rchild, x);
updateHeight(root);
if (getHeight(root) == -2)
if (getHeight(root->rchild) == -1)
L(root);
else if (getHeight(root->rchild) == 1)
{
R(root->rchild);
L(root);
}
}
else
{
insert(root->lchild, x);
updateHeight(root);
if (getHeight(root) == 2)
if (getHeight(root->lchild) == 1)
R(root);
else if (getHeight(root->lchild) == -1)
{
L(root->lchild);
R(root);
}
}
}
node* create(int data[], int n)
{
node* root = NULL;
for (int i = 0; i < n; i++)
insert(root, data[i]);
return root;
}