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
# include <iostream>
# include <algorithm>
using namespace std;
struct node{
int data, height;
node *lchild, *rchild;
};
int getheight(node *root){
if(root == NULL) return 0;
return root->height;
}
void updateheight(node *root){
root->height = max(getheight(root->lchild), getheight(root->rchild)) + 1;
}
int getBalanceFactor(node *root){
return getheight(root->lchild) - getheight(root->rchild);
}
void lrotation(node *& root){
node *tmp = root->rchild;
root->rchild = tmp->lchild;
tmp->lchild = root;
updateheight(root);
updateheight(tmp);
root = tmp;
}
void rrotation(node *& root){
node *tmp = root->lchild;
root->lchild = tmp->rchild;
tmp->rchild = root;
updateheight(root);
updateheight(tmp);
root = tmp;
}
void insert(node *& root, int data){
if(root == NULL){
root = new node;
root->data = data;
root->lchild = root->rchild = NULL;
root->height = 1;
return ;
}
if(data < root->data){
insert(root->lchild, data);
updateheight(root);
if(getBalanceFactor(root) == 2){
if(getBalanceFactor(root->lchild) == 1){
rrotation(root);
}
else if(getBalanceFactor(root->lchild) == -1){
lrotation(root->lchild);
rrotation(root);
}
}
}
else{
insert(root->rchild, data);
updateheight(root);
if(getBalanceFactor(root) == -2){
if(getBalanceFactor(root->rchild) == -1){
lrotation(root);
}
else if(getBalanceFactor(root->rchild) == 1){
rrotation(root->rchild);
lrotation(root);
}
}
}
}
node *create(int data[], int n){
node * root = NULL;
for(int i = 0; i < n; i++){
insert(root, data[i]);
}
return root;
}
int main(){
// freopen("C:\\1.txt", "r", stdin);
node *root = NULL;
int n, data[22];
cin >> n;
for(int i = 0; i < n; i++){
cin >> data[i];
}
root = create(data, n);
cout << root->data << endl;
}