编写程序，从键盘输入6个整数，逐个插入到AVL树中，在每次插入时重新平衡。根据你输入的整数序列，在草稿纸上画出该AVL树，遍历输出该树并检查结果是否正确。

题目：编写程序，从键盘输入6个整数，逐个插入到AVL树中，在每次插入时重新平衡。根据你输入的整数序列，在草稿纸上画出该AVL树，遍历输出该树并检查结果是否正确。

知识梳理：

1.AVL树的结构体定义：

由AVL树的定义，需要判断左右子树的高度差是否大于1，因此在树结点定义中增加Height域，在每次插入/删除结点时更新结点的Height域

struct AVLNode {
    ElementType Data;
    int Height;
    struct AVLNode *Left;
    struct AVLNode *Right;
};

2.求AVL树的高度：

int GetHeight(struct AVLNode*T){

if(T==NULL){

return 0;

}

else{

return 1+Max(GetHeight(T->Left),GetHeight(T->Right));

}

}

int Max(int a,int b){

   Return a>b?a:b;

}

3.AVL树的左单旋：

struct AVLNode* SingleLeftRotation(struct AVLNode * K2) {//K2为不平衡点
    struct AVLNode *K1;
    K1 = K2->Left;旋转前K1和K2的关系
    K2->Left = K1->Right;旋转后K1和K2的关系
    K1->Right = K2;
    // 旋转完后更新K1、K2的高度
    K2->Height = Max(GetHeight(K2->Left), GetHeigth(K2->Right)) + 1;
    K1->Height = Max(GetHeigth(K1->Left), K2->Height) + 1;
    return K1;
}

4.AVL树的右单旋：

struct AVLNode * SingleRightRotation(struct AVLNode *K1) {
    struct AVLNode *K2;

    K2 = K1->Right;
    K1->Right = K2->Left;
    K2->Left = K1;
    // 旋转完后更新K1、K2的深度
    K1->Height = Max(GetHeight(K1->Left), GetHeight(K1->Right)) + 1;
    K2->Height = Max(K1->Height, GetHeight(K2->Right)) + 1;
    return K2;
}

  5.AVL树的左双旋：

struct AVLNode * DoubleLeftRotation(struct AVLNode * K2)K2为不平衡结点
{
    K2->Left = SingleRightRotation(K2->Left);
    return SingleLeftRotation(K2);
}

  5.AVL树的右双旋：

struct AVLNode * DoubleRightRotation(struct AVLNode * K1)
{
    K1->Right = SingleLeftRotation(K1->Right);
    return SingleRightRotation(K1);
}

 6.AVL树的插入：

struct AVLNode * InsertAVL(struct AVLNode * T, ElementType X) {
    if (T == NULL) {如果树为空，则创建一个新的结点为一棵树，将插入的数存入结点中
        T = malloc(sizeof(struct AVLNode));
        T->Data = X;
        T->Height = 1;插入数后设置树的高度为1
        T->Left = T->Right = NULL;
    } else if (X < T->Data) {树不为空时，若在插入的树小于根节点的内容
        T->Left = InsertAVL(T->Left, X);在左子树中插入x
        if (GetHeight(T->Left) - GetHeight(T->Right) == 2)判断在插入树后是否有结点不平衡
            if (X < T->Left->Data)如果在左子树的外面进行插入
                T = SingleLeftRotation(T);则进行左单旋转
            else
                T = DoubleLeftRotation(T);如果在左子树的里面插入，则进行双左旋
    } else if (X > T->Data) {
        T->Right = InsertAVL(T->Right, X);
        if (GetHeight(T->Right) - GetHeight(T->Left) == 2)
            if (X > T->Right->Data)
                T = SingleRightRotation(T);
            else
                T = DoubleRightRotation(T);
    }
    // else X == T->Data的情况，不做任何事
    T->Height = Max(GetHeight(T->Left), GetHeight(T->Right)) + 1;
    return T;
}

源代码：

#include<stdio.h>
#include<stdlib.h> 
struct AVLNode{ 
    int Data;
    int Height;
    struct AVLNode * Left;
    struct AVLNode * Right;
};
int Max(int a,int b){
	return a>b?a:b;
}
int GetHeight(struct AVLNode*T){
	if(T==NULL){
		return 0;
	}
	else{
		return 1+Max(GetHeight(T->Left),GetHeight(T->Right));
	}
}
struct AVLNode* SLR(struct AVLNode * K2) {
    struct AVLNode *K1;
    K1 = K2->Left;
    K2->Left = K1->Right;
    K1->Right = K2;
    // 旋转完后更新K1、K2的高度
    K2->Height = Max(GetHeight(K2->Left), GetHeight(K2->Right)) + 1;
    K1->Height = Max(GetHeight(K1->Left), K2->Height) + 1;
    return K1;
}
struct AVLNode * SRR(struct AVLNode *K1) {
    struct AVLNode *K2;
    K2 = K1->Right;
    K1->Right = K2->Left;
    K2->Left = K1;
    // 旋转完后更新K1、K2的深度
    K1->Height = Max(GetHeight(K1->Left), GetHeight(K1->Right)) + 1;
    K2->Height = Max(K1->Height, GetHeight(K2->Right)) + 1;
    return K2;
}
struct AVLNode * DLR(struct AVLNode * K2)
{
    K2->Left = SRR(K2->Left);
    return SLR(K2);
}
struct AVLNode * DRR(struct AVLNode * K1)
{
    K1->Right = SLR(K1->Right);
    return SRR(K1);
}
struct AVLNode * InsertAVL(struct AVLNode * T, int X) {
    if (T == NULL) {
        T = (struct AVLNode*)malloc(sizeof(struct AVLNode));
        T->Data = X;
        T->Height = 1;
        T->Left = T->Right = NULL;
    } else if (X < T->Data) {
        T->Left = InsertAVL(T->Left, X);
        if (GetHeight(T->Left) - GetHeight(T->Right) == 2)
            if (X < T->Left->Data)
                T = SLR(T);
            else
                T = DLR(T);
    } else if (X > T->Data) {
        T->Right = InsertAVL(T->Right, X);
        if (GetHeight(T->Right) - GetHeight(T->Left) == 2)
            if (X > T->Right->Data)
                T = SRR(T);
            else
                T = DRR(T);
    }
    // else X == T->Data的情况，不做任何事
    T->Height = Max(GetHeight(T->Left), GetHeight(T->Right)) + 1;
    return T;
}

void PreOrder(struct AVLNode*T){
	if(T!=NULL){
		printf("%d ",T->Data);
		PreOrder(T->Left);
		PreOrder(T->Right); 
	}
}
void InOrder(struct AVLNode*T){
	if(T!=NULL){
		InOrder(T->Left);
		printf("%d ",T->Data);
		InOrder(T->Right); 
	}
}
void PostOrder(struct AVLNode*T){
	if(T!=NULL){
		PostOrder(T->Left);
		PostOrder(T->Right); 
		printf("%d ",T->Data);
	}
}
int main(){
	int i,j;
	struct AVLNode*T;
	T=NULL;
	for(i=0;i<6;i++){
		scanf("%d",&j);
		T=InsertAVL(T,j);
	}
	printf("\n");
	printf("先序：");PreOrder(T);
	printf("\n");
	printf("中序：");InOrder(T);
	printf("\n");
	printf("后序：");PostOrder(T); 
	printf("\n");
	return 0;
} 

实验结果：