AVL树的建立
//
// main.cpp
// PATA1066
//
// Created by Phoenix on 2018/2/25.
// Copyright © 2018年 Phoenix. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct node {
int data, height;
node *lchild, *rchild;
};
node* newnode(int x) {
node* root = new node;
root->data = x;
root->height = 1;
root->lchild = root->rchild = NULL;
return root;
}
int getHeight(node* root) {
if(root == NULL) return 0;
else return root->height;
}
int getBalanceFactor(node* root) {
return getHeight(root->lchild) - getHeight(root->rchild);
}
void updateHeight(node* root) {
root->height = max(getHeight(root->lchild), getHeight(root->rchild)) + 1;
}
void L(node* &root) {
node* temp = root->rchild;
root->rchild = temp->lchild;
temp->lchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
void R(node* &root) {
node* temp = root->lchild;
root->lchild = temp->rchild;
temp->rchild = root;
updateHeight(root);
updateHeight(temp);
root = temp;
}
void insert(node* &root, int x) {
if(root == NULL) {
root = newnode(x);
return;
}
if(x < root->data) {
insert(root->lchild, x);
updateHeight(root);
if(getBalanceFactor(root) == 2) {
if(getBalanceFactor(root->lchild) == 1) {
R(root);
} else if(getBalanceFactor(root->lchild) == -1) {
L(root->lchild);
R(root);
}
}
} else {
insert(root->rchild, x);
updateHeight(root);
if(getBalanceFactor(root) == -2) {
if(getBalanceFactor(root->rchild) == -1) {
L(root);
} else if(getBalanceFactor(root->rchild) == 1) {
R(root->rchild);
L(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(int argc, const char * argv[]) {
int n;
scanf("%d", &n);
int num[n];
for(int i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
node* root = create(num, n);
printf("%d", root->data);
return 0;
}