一、题目描述
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤ 20). 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, insert the keys one by one into an initially empty AVL tree. Then first print in a line the level-order traversal sequence of the resulting AVL tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line. Then in the next line, print YES if the tree is complete, or NO if not.
Sample Input 1:
5
88 70 61 63 65
Sample Output 1:
70 63 88 61 65
YES
Sample Input 2:
8
88 70 61 96 120 90 65 68
Sample Output 2:
88 65 96 61 70 90 120 68
NO
二、解题思路
这道题目考到了AVL树的基本操作和层序遍历,对于AVL树,如果出现了某个结点孩子为空,并且后面的结点还有孩子结点,则它不是一个完全二叉树。但是AVL树的操作还是有点复杂了,由于做的练习比较少,对AVL树的理解也没有很深,所以这里也不是用的自己的代码,详情可参考柳神的代码。
1123 Is It a Complete AVL Tree (30分)
三、AC代码
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct node {
int val;
struct node *left, *right;
};
node* leftRotate(node *tree) {
node *temp = tree->right;
tree->right = temp->left;
temp->left = tree;
return temp;
}
node* rightRotate(node *tree) {
node *temp = tree->left;
tree->left = temp->right;
temp->right = tree;
return temp;
}
node* leftRightRotate(node *tree) {
tree->left = leftRotate(tree->left);
return rightRotate(tree);
}
node* rightLeftRotate(node *tree) {
tree->right = rightRotate(tree->right);
return leftRotate(tree);
}
int getHeight(node *tree) {
if (tree == NULL) return 0;
int l = getHeight(tree->left);
int r = getHeight(tree->right);
return max(l, r) + 1;
}
node* insert(node *tree, int val) {
if (tree == NULL) {
tree = new node();
tree->val = val;
}else if (tree->val > val) {
tree->left = insert(tree->left, val);
int l = getHeight(tree->left), r = getHeight(tree->right);
if (l - r >= 2) {
if (val < tree->left->val)
tree = rightRotate(tree);
else
tree = leftRightRotate(tree);
}
} else {
tree->right = insert(tree->right, val);
int l = getHeight(tree->left), r = getHeight(tree->right);
if (r - l >= 2) {
if (val > tree->right->val)
tree = leftRotate(tree);
else
tree = rightLeftRotate(tree);
}
}
return tree;
}
int isComplete = 1, after = 0;
vector<int> levelOrder(node *tree) { //层序遍历
vector<int> v;
queue<node *> queue;
queue.push(tree);
while (!queue.empty()) {
node *temp = queue.front();
queue.pop();
v.push_back(temp->val);
if (temp->left != NULL) {
if (after) isComplete = 0;
queue.push(temp->left);
} else {
after = 1;
}
if (temp->right != NULL) {
if (after) isComplete = 0;
queue.push(temp->right);
} else {
after = 1;
}
}
return v;
}
int main() {
int n, temp;
scanf("%d", &n);
node *tree = NULL;
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
tree = insert(tree, temp);
}
vector<int> v = levelOrder(tree);
for (int i = 0; i < v.size(); i++) {
if (i != 0) printf(" ");
printf("%d", v[i]);
}
printf("\n%s", isComplete ? "YES" : "NO");
return 0;
}