PAT A1066. Root of AVL Tree (25) [平衡⼆叉树（AVL树） ]

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of
any node difer by at most one; if at any time they difer 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.

题⽬⼤意： AVL树是⾃平衡⼆叉搜索树。 在AVL树中，任何节点的两个⼦⼦树的⾼度最多相差⼀个；如
果在任何时候它们相差多于⼀个，则重新平衡以恢复此属性。 图1-4说明了旋转规则～现在给出⼀系列
插⼊，要求输出根节点的值～
分析：写出建AVL（平衡⼆叉搜索树）的代码模版即可， rotateLef表示左旋， rotateRight表示右旋，
rotateLefRight表示先左旋后右旋， rotateRightLef表示先右旋后左旋， getHeight表示获取传⼊结点的
⼦树的⾼度， insert表示插⼊建树的过程，如果root为空，直接新建结点插⼊即可～如果当前要插⼊的
值⼩于root->val，则插⼊root的左⼦树；如果当前要插⼊的值⼤于root->val，则插⼊root的右⼦树～如
果插⼊后左右⼦树⾼度差⼤于1，再根据值的⼤⼩⽐较进⾏旋转调整使树平衡～插⼊完成后返回root指
针赋值给main函数⾥的root～最后输出root的val值～

#include <iostream>
using namespace std;
struct node {
	int val;
	struct node *left, *right;
};
node *rotateLeft(node *root) {
	node *t = root->right;
	root->right = t->left;
	t->left = root;
	return t;
}
node *rotateRight(node *root) {
	node *t = root->left;
	root->left = t->right;
	t->right = root;
	return t;
}
node *rotateLeftRight(node *root) {
	root->left = rotateLeft(root->left);
	return rotateRight(root);
}
node *rotateRightLeft(node *root) {
	root->right = rotateRight(root->right);
	return rotateLeft(root);
}
int getHeight(node *root) {
	if(root == NULL) return 0;
	return max(getHeight(root->left), getHeight(root->right)) + 1;
}
node *insert(node *root, int val) {
	if(root == NULL) {
		root = new node();
		root->val = val;
		root->left = root->right = NULL;
	} else if(val < root->val) {
		root->left = insert(root->left, val);
		if(getHeight(root->left) - getHeight(root->right) == 2)
		root = val < root->left->val ? rotateRight(root) :
		rotateLeftRight(root);
	} else {
		root->right = insert(root->right, val);
		if(getHeight(root->left) - getHeight(root->right) == -2)
			root = val > root->right->val ? rotateLeft(root) :
		rotateRightLeft(root);
	}
	return root;
}
int main() {
	int n, val;
	scanf("%d", &n);
	node *root = NULL;
	for(int i = 0; i < n; i++) {
		scanf("%d", &val);
		root = insert(root, val);
	}
	printf("%d", root->val);
	return 0;
}