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 output the level-order traversal sequence of the resulting AVL tree, and to tell if it is a complete binary tree.
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树一共有四种情况，这里我把发现树不平衡的那个结点叫做A结点，A发现树不平衡的情况有四种：
新来的结点插入到A的左子树的左子树
新来的结点插入到A的左子树的右子树
新来的结点插入到A的右子树的左子树
新来的结点插入到A的右子树的右子树
发现不平衡时就需要处理，第1种情况只要简单的右旋，第4种情况只需左旋一下，第2种情况需要先对A的左子树左旋一下，然后对A右旋，同理第3种情况需要对A的右子树右旋一下，然后对A左旋就可以啦～～～
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 |
#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; } |
❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼
❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼
❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版
