PAT-1066 Root of AVL Tree

1066 Root of AVL Tree (25)（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

  平衡二叉树插入元素后的旋转问题，每插入一个元素需要从下到上依次调整插入路径上的非平衡节点，所以插入函数用递归比较方便。根据非平衡节点的类型分为LL,LR,RR,RL型。分别进行对应的左旋和右旋操作可以调整平衡。

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
int num[25]; 

typedef struct node{
	int val,height;
	node *left,*right;
}node;
node* newnode(int v){
	node* n=(node*)malloc(sizeof(node));
	n->height=1;
	n->val=v;
	n->left=NULL;
	n->right=NULL;
	return n;
}
int geth(node *&root){
	if(root==NULL)
		return 0;
	return root->height;
}
void updateH(node *&root){
	root->height=std::max(geth(root->left),geth(root->right))+1;
}
int getBanFac(node *&n){
	if(n==NULL)
		return 0;
	return geth(n->left)-geth(n->right);
}
void left(node *&root){//左旋
	node *tmp=root->right;
	root->right=tmp->left;
	tmp->left=root;
	updateH(root);//先更新下面的
	updateH(tmp);//再更新上面的
	root=tmp;
}
void right(node *&root){//右旋
	node *tmp=root->left;
	root->left=tmp->right;
	tmp->right=root;
	updateH(root);//先更新下面的
	updateH(tmp);//再更新上面的
	root=tmp;
}
void insertn(node *&n,int v){
	if(n==NULL){
		n=newnode(v);
		return;
	}
	if(n->val>v){
		insertn(n->left,v);
		updateH(n);
		int fac1=getBanFac(n);
		int fac2=getBanFac(n->left);
		if(fac1==2){
			if(fac2==1){//LL
				right(n);
			}else if(fac2==-1){//LR
				left(n->left);
				right(n);
			}
		}
	}else{
		insertn(n->right,v);
		updateH(n);
		int fac1=getBanFac(n);
		int fac2=getBanFac(n->right);
		if(fac1==-2){
			if(fac2==-1){//RR
				left(n);
			}else if(fac2==1){//RL
				right(n->right);
				left(n);
			}
		}
	}
}

int main(){
	int t;
	scanf("%d",&t);
	for(int i=0;i<t;i++){
		scanf("%d",num+i);
	}
	node* root=NULL;
	for(int i=0;i<t;i++){
		insertn(root,num[i]);
	}

	printf("%d",root->val);
	return 0;
}