1066 Root of AVL Tree-PAT甲级

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

 题目大意：给出一颗AVL树的结点插入顺序的序列，求出该AVL树的根节点

 思路：按照给出AVL树插入顺序的序列直接建立AVL树即可，具体操作可见二叉平衡树（AVL树）

具体包括AVL树的结构体定义，新建结点，获得树高，更新树高，左旋，右旋，获得平衡因子，插入结点等操作

AC代码

#include <iostream>
using namespace std;
struct tree {
	int height;
	int data;
	tree* lchild;
	tree* rchild;
};
tree* newroot(int data) {
	tree* root = new tree;
	root->lchild = root->rchild = NULL;
	root->data = data;
	root->height = 1;
	return root;
}
int getHeight(tree* root) {
	if (root == NULL) {
		return 0;
	} else {
		return root->height;
	}
}
void updateHeight(tree* root) {
	root->height = max(getHeight(root->lchild), getHeight(root->rchild)) + 1;
}
int getBF(tree* root) {
	return getHeight(root->lchild) - getHeight(root->rchild);
} 
void L(tree* &root) {
	tree* temp;
	temp = root->rchild;
	root->rchild = temp->lchild;
	temp->lchild = root;
	updateHeight(root);
	updateHeight(temp);
	root = temp;
}
void R(tree* &root) {
	tree* temp;
	temp = root->lchild;
	root->lchild = temp->rchild;
	temp->rchild = root;
	updateHeight(root);
	updateHeight(temp);
	root = temp;
}
void insert(tree* &root, int data) {
	if (root == NULL) {
		root = newroot(data);
		return;
	}
	if (data < root->data) {
		insert(root->lchild, data);
		updateHeight(root);
		if (getBF(root) == 2) {
			if (getBF(root->lchild) == 1) {
				R(root);
			} else if (getBF(root->lchild) == -1) {
				L(root->lchild);
				R(root);
			}
		}
	} else {
		insert(root->rchild, data);
		updateHeight(root);
		if (getBF(root) == -2) {
			if (getBF(root->rchild) == -1) {
				L(root);
			} else if (getBF(root->rchild) == 1) {
				R(root->rchild);
				L(root);
			}
		}
	}
}
int main() {
	int n;
	cin >> n;
	tree* root = NULL;
	while (n--) {
		int data;
		cin >> data;
		insert(root, data);
	}
	cout << root->data;
	return 0;
}

更多PAT甲级题目：请访问PAT甲级刷题之路--题目索引+知识点分析（正在进行），感谢支持！