PAT甲级1066 Root of AVL Tree (25 分)

1066 Root of AVL Tree (25 分)

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.

 

 

Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤20) which is the total number of keys to be inserted. Then N distinct integer keys are given in the next line. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the root of the resulting AVL tree in one line.

Sample Input 1:

5

88 70 61 96 120

Sample Output 1:

70

Sample Input 2:

7

88 70 61 96 120 90 65

Sample Output 2:

88

      题目大意：

         给出n为长度的一个序列，求平衡二叉树的根节点。

 

思路：

         实质在考察LR操作与平衡二叉树建树。

 

参考代码：

 

#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
	int v;
	node *l , *r;
};
int getH(node * root){
	if(root == NULL)	return 0;
	return max(getH(root->l), getH(root->r)) + 1;
}
void L(node * & root){
	node * temp = root->r;
	root->r = temp->l;
	temp->l = root;
	root = temp;
}
void R(node * & root){
	node * temp = root->l;
	root->l = temp->r;
	temp->r = root;
	root = temp;
}
void LR(node * &root){
	L(root->l), R(root);
}
void RL(node * &root){
	R(root->r), L(root);
}
void insert(node * & root , int v){
	if(root == NULL){
		node * temp = new node;
		temp->v = v;
		temp->r = temp->l = NULL;
		root = temp;
	} else if(v < root->v){
		insert(root->l, v);
		if(getH(root->l) - getH(root->r) == 2)	v < root->l->v? R(root): LR(root);
	} else{
		insert(root->r, v);
		if(getH(root->l) - getH(root->r) == -2)	v < root->r->v? RL(root) : L(root);
	}
}
int main(){
	int n, temp;
	scanf("%d", &n);
	node * root = NULL; 
	for(int i = 0; i < n; ++i){
		scanf("%d", &temp);
		insert(root, temp);
	}
	printf("%d", root->v);
	return 0;
}