PAT 1147 Heaps（30 分） [自己开发的博客网站，欢迎访问](www.weiboke.online) www.weiboke.online

自己开发的博客网站，欢迎访问 www.weiboke.online

1147 Heaps（30 分）

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))

Your job is to tell if a given complete binary tree is a heap.

Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 100), the number of trees to be tested; and N (1 < N ≤ 1,000), the number of keys in each tree, respectively. Then M lines follow, each contains N distinct integer keys (all in the range of int), which gives the level order traversal sequence of a complete binary tree.

Output Specification:
For each given tree, print in a line Max Heap if it is a max heap, or Min Heap for a min heap, or Not Heap if it is not a heap at all. Then in the next line print the tree’s postorder traversal sequence. All the numbers are separated by a space, and there must no extra space at the beginning or the end of the line.

Sample Input:
3 8
98 72 86 60 65 12 23 50
8 38 25 58 52 82 70 60
10 28 15 12 34 9 8 56
Sample Output:
Max Heap
50 60 65 72 12 23 86 98
Min Heap
60 58 52 38 82 70 25 8
Not Heap
56 12 34 28 9 8 15 10

Approach

题目大意：验证性题目，给定一组数据，判断是否为最大堆、最小堆、不是堆，然后再将其后序遍历输出
思路方法：首先要熟悉堆的性质，其父节点肯定比子节点大或小，然后是完全二叉树，而且父节点和子节点有对应的关系，所以可以很容易地输出后序遍历。

Code

bool validmaxheap(vector<int> &heap, int parents, int len) {
	int a = parents * 2 + 1;
	int b = parents * 2 + 2;
	if (a >= len && b >= len)
		return true;
	if (a<len&&heap[parents] < heap[a])
		return false;
	if (b<len&&heap[parents] < heap[b])
		return false;
	return validmaxheap(heap, a, len) && validmaxheap(heap, b, len);
}
bool validminheap(vector<int> &heap, int parents, int len) {
	int a = parents * 2 + 1;
	int b = parents * 2 + 2;
	if (a >= len && b >= len) 
		return true;
	if (a<len&&heap[parents] > heap[a])
		return false;
	if (b<len&&heap[parents] > heap[b])
		return false;
	return validminheap(heap, a, len) && validminheap(heap, b, len);
}
void postordertraval(vector<int> &heap, int parents, int len, vector<int> &nums) {
	if (parents >= len)return;
	int a = parents * 2 + 1;
	int b = parents * 2 + 2;
	postordertraval(heap, a, len, nums);
	postordertraval(heap, b, len, nums);
	nums.push_back(heap[parents]);
}
void printanswer(vector<int>& nums) {
	for (int i = 0; i < nums.size(); i++) {
		if (i == 0)
			printf("%d", nums[i]);
		else
			printf(" %d", nums[i]);
	}
	printf("\n");
}
int main() {
	int N, M;
	scanf("%d%d", &N, &M);
	while (N--) {
		vector<int>heap;
		for (int i = 0; i < M; i++) {
			int a;
			scanf("%d", &a);
			heap.push_back(a);
		}
		if (heap[0] > heap[1]) {
			bool maxheap = validmaxheap(heap, 0, M);
			if (maxheap)
				printf("Max Heap\n");
			else
				printf("Not Heap\n");
		}
		else 	if (heap[0] < heap[1]) {
			bool minheap = validminheap(heap, 0, M);
			if (minheap)
				printf("Min Heap\n");
			else
				printf("Not Heap\n");
		}
		vector<int> nums;
		postordertraval(heap, 0, M, nums);
		printanswer(nums);
	}
	return 0;
}