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.
![](http://nos.patest.cn/79_mtxjq1kj3gx.jpg)
![](http://nos.patest.cn/79_mtxjqnwja2o.jpg)
![](http://nos.patest.cn/79_mtxjr4gyzdg.jpg)
![](http://nos.patest.cn/79_mtxjrh51o9y.jpg)
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 ythe root of the resulting AVL tree in one line.
Sample Input 1:5 88 70 61 96 120Sample Output 1:
70Sample Input 2:
7 88 70 61 96 120 90 65Sample Output 2:
88
建立平衡二叉树即可, 然后输出根节点。
题解:
#include <stdio.h>
#include <algorithm>
#define MAX 20
using namespace std;
struct Node
{
int data, h;
Node *left, *right;
};
int n, seq[MAX];
Node* newNode(int x)
{
Node* root = new Node;
root->data = x;
root->h = 1;
root->left = root->right = NULL;
return root;
}
int geth(Node* root)
{
if(root != NULL) return root->h;
return 0;
}
void updateh(Node* root)
{
root->h = max(geth(root->left), geth(root->right))+1;
}
int getbf(Node* root)
{
return geth(root->left) - geth(root->right);
}
void L(Node* &root)
{
Node* temp = root->right;
root->right = temp->left;
temp->left = root;
updateh(root);
updateh(temp);
root = temp;
}
void R(Node* &root)
{
Node* temp = root->left;
root->left = temp->right;
temp->right = root;
updateh(root);
updateh(temp);
root = temp;
}
void insert(Node* &root, int x)
{
if(root == NULL)
{
root = newNode(x);
return;
}
if(x < root->data)
{
insert(root->left, x);
updateh(root);
if(getbf(root) == 2)
{
if(getbf(root->left) == 1) R(root);
else if(getbf(root->left) == -1)
{
L(root->left);
R(root);
}
}
}
else if(x > root->data)
{
insert(root->right, x);
updateh(root);
if(getbf(root) == -2)
{
if(getbf(root->right) == -1) L(root);
else if(getbf(root->right) == 1)
{
R(root->right);
L(root);
}
}
}
}
Node* create()
{
Node* root = NULL;
for(int i = 0; i < n; i++)
{
insert(root, seq[i]);
}
return root;
}
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%d", &seq[i]);
}
Node* root = create();
printf("%d", root->data);
return 0;
}