1123. Is It a Complete AVL Tree (30)-PAT甲级真题 (AVL模板 + BFS)

题意

给一个序列，挨个插入AVL建树，输出该树的层序遍历序列，并求所得是否完全二叉树。

题解

//12:24 - 
#include<bits/stdc++.h>
using namespace std;
struct node{
	int k;
	struct node *l, *r;
};
int gh(node * t){
	if(t == NULL) return 0;
	return max(gh(t->l), gh(t->r)) + 1;
}
node* rotater(node* t){
	node* tmp = t->l;
	t->l = tmp->r;
	tmp->r = t;
	return tmp;
}
node* rotatel(node* t){
	node* tmp = t->r;
	t->r = tmp->l;
	tmp->l = t;
	return tmp;
}
node* rotaterl(node * t){
	t->r = rotater(t->r);
	return rotatel(t);
}
node* rotatelr(node * t){
	t->l = rotatel(t->l);
	return rotater(t);
}
node* insert(node* t, int k){
	if(t == NULL){
		t = (node*)malloc(sizeof(node));
		t->k = k, t->l = t->r = NULL;
	}else if(k >= t->k){
		t->r = insert(t->r, k);
		if(gh(t->r) > gh(t->l) + 1)
			t = k >= t->r->k ? rotatel(t) : rotaterl(t);
	}else{
		t->l = insert(t->l, k);
		if(gh(t->l) > gh(t->r) + 1)
			t = k < t->l->k ? rotater(t) : rotatelr(t);
	}
	return t;
}
int main(){
	int n; cin>>n;
	node* t = NULL;
	for(int i = 0; i < n; i ++){
		int k; cin>>k;
		t = insert(t, k);
	}
	queue<node*> que;
	que.push(t);
	vector<int> ans;
	bool f = true;
	int cnt = 1;
	while(que.size()){
		auto tar = que.front(); que.pop();
		ans.push_back(tar->k);
		if(tar->l){
			que.push(tar->l);
			if(f) cnt++;
		}else f = false;
		if(tar->r){
			que.push(tar->r);
			if(f) cnt++;
		}else f = false;
	}
	for(int i = 0; i < ans.size(); i++)
		printf("%d%c",ans[i], i != ans.size() - 1 ? ' ' : '\n');
	puts(cnt == n ? "YES" : "NO");
	return 0;
}

题目

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