04-树5-Root of AVL Tree-编程题

本题思路来源

04-树5 Root of AVL Tree (25 分)【每日一题】

解题代码

#include<stdio.h>
#include<stdlib.h>
typedef struct TNode* AVLTree;
struct TNode {
	int data;
	AVLTree Left, Right;
	int height;
};
AVLTree Insert(AVLTree T, int K);
int Max(int A, int B);
int Getheight(AVLTree T);
AVLTree Singleleftrotate(AVLTree A);
AVLTree Singlerightrotate(AVLTree A);
AVLTree Doubleleftrightrotate(AVLTree A);
AVLTree Doublerightleftrotate(AVLTree A);
int main()
{
	int N, i, K;
	AVLTree T = NULL;
	scanf("%d", &N);
	for (i = 0; i < N; i++) {
		scanf("%d", &K);
		T = Insert(T, K);
	}
	printf("%d", T->data);
	return 0;
}
AVLTree Insert(AVLTree T, int K) {
	if (!T) {
		T = malloc(sizeof(struct TNode));
		T->data = K;
		T->Left = T->Right = NULL;
	}
	else if (K < T->data) {
		T->Left = Insert(T->Left, K);
		if (Getheight(T->Left) - Getheight(T->Right) == 2) {
			if (K < T->Left->data) return Singleleftrotate(T);
			else if (K > T->Left->data) return Doubleleftrightrotate(T);
		}
	}
	else if (K > T->data) {
		T->Right = Insert(T->Right, K);
		if (Getheight(T->Right) - Getheight(T->Left) == 2) {
			if (K > T->Right->data) return Singlerightrotate(T);
			else if (K < T->Right->data)return Doublerightleftrotate(T);
		}
	}
	T->height = Max(Getheight(T->Left), Getheight(T->Right)) + 1;
	return T;
}
int Max(int A, int B) {
	return A > B ? A : B;
}
int Getheight(AVLTree T) {
	if (!T) return -1;
	else return T->height;
}
AVLTree Singleleftrotate(AVLTree A) {
	AVLTree B = A->Left;
	A->Left = B->Right;
	B->Right = A;
	A->height = Max(Getheight(A->Left), Getheight(A->Right)) + 1;
	B->height = Max(Getheight(B->Left), A->height) + 1;
	return B;
}
AVLTree Singlerightrotate(AVLTree A) {
	AVLTree B = A->Right;
	A->Right = B->Left;
	B->Left = A;
	A->height = Max(Getheight(A->Left), Getheight(A->Right)) + 1;
	B->height = Max(A->height, Getheight(B->Right)) + 1;
	return B;
}
AVLTree Doubleleftrightrotate(AVLTree A) {
	AVLTree B = A->Left;
	A->Left = Singlerightrotate(B);
	return Singleleftrotate(A);
}
AVLTree Doublerightleftrotate(AVLTree A) {
	AVLTree B = A->Right;
	A->Right = Singleleftrotate(B);
	return Singlerightrotate(A);
}

测试结果

问题整理

1.该题较为复杂，要尤其注意四种旋转方式的逻辑。