AVL的插入

#include<stdio.h>
#include<stdlib.h>
typedef struct p
{
int data;
int bf;
struct p *lc,*rc;
}*node;
void lRotate(node &T)
//左旋转
{
node rc;
rc=(node )malloc(sizeof(node));
rc=T->rc ;
T->rc =rc->lc ;
rc->lc =T;
T=rc;
}
void rRotate(node &T)
//右旋转
{
node lc;
lc=(node )malloc(sizeof(node));
lc=T->lc ;
T->lc =lc->rc ;
lc->rc =T;
T=lc;
}
void leftbalance(node &T)
//AVL进行做旋转
{
node p,q;
p=(node )malloc(sizeof(node));
q=(node )malloc(sizeof(node));
if(p)
{
p=T->lc ;
switch(p->bf )
{
case 1:
{
T->bf =p->bf =0;
rRotate(T);
break;
}
case -1:
{
q=p->rc ;
switch(q->bf )
{
case 1:
T->bf =-1;
p->bf =0;
break;
case 0:
T->bf =p->bf =0;
break;
case -1:
T->bf =0;
p->bf =1;
break;
}
lRotate(T->lc);
rRotate(T);
}
}
}
else
printf("creat fail\n");
}
void rightbalance(node &T)
//AVL进行右旋转
{
node p,q;
p=(node )malloc(sizeof(node));
q=(node )malloc(sizeof(node));
if(p)
{
p=T->rc ;
switch(p->bf )
{
case -1:
{
T->bf =p->bf =0;
lRotate(T);
break;
}
case 1:
{
q=p->lc ;
switch(q->bf )
{
case 1:
T->bf =0;
p->bf =-1;
break;
case 0:
T->bf =p->bf =0;
break;
case -1:
T->bf =1;
p->bf =0;

转载于:https://www.cnblogs.com/jim-wu/archive/2011/09/30/2196050.html