PAT甲级1155 Heap Paths (30 分)

最新推荐文章于 2022-04-04 23:32:31 发布

rf4csdm

最新推荐文章于 2022-04-04 23:32:31 发布

阅读量152

点赞数

分类专栏： PAT甲级文章标签： PAT

本文链接：https://blog.csdn.net/qq_42306885/article/details/100604684

版权

PAT甲级专栏收录该内容

158 篇文章 0 订阅

订阅专栏

1155 Heap Paths (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))

One thing for sure is that all the keys along any path from the root to a leaf in a max/min heap must be in non-increasing/non-decreasing order.

Your job is to check every path in a given complete binary tree, in order to tell if it is a heap or not.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (1<N≤1,000), the number of keys in the tree. Then the next line 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, first print all the paths from the root to the leaves. Each path occupies a line, with all the numbers separated by a space, and no extra space at the beginning or the end of the line. The paths must be printed in the following order: for each node in the tree, all the paths in its right subtree must be printed before those in its left subtree.

Finally 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.

Sample Input 1:

98 72 86 60 65 12 23 50

Sample Output 1:

98 86 23

98 86 12

98 72 65

98 72 60 50

Max Heap

Sample Input 2:

8 38 25 58 52 82 70 60

Sample Output 2:

8 25 70

8 25 82

8 38 52

8 38 58 60

Min Heap

Sample Input 3:

10 28 15 12 34 9 8 56

Sample Output 3:

10 15 8

10 15 9

10 28 34

10 28 12 56

Not Heap

题目大意：

给出n个结点的堆，判定是大顶堆还是小顶堆或者不是堆。输出从根节点到每一个叶子结点的序列。

思路：

由于给的就是层序，相当于静态二叉树，用flag 来表示是否为堆，大顶堆或者小顶堆，用1与-1表示，非堆flag = 0，先假定任一一种情况，如t[0] >= t[1] flag = 1。每次都dfs输出序列。

参考代码：

#include<vector>
#include<cstdio>
using namespace std;
int flag, n;
vector<int> t, ans;
void dfs(int v){
	ans.push_back(t[v]);
	if(2 * v + 1 >= n && 2 * v + 2 >= n){
		for(int i = 0; i < ans.size(); ++i){
			printf("%d%c", ans[i], i != ans.size() - 1? ' ' : '\n');
			if(i != 0)
				if(ans[i] > ans[i - 1] && flag == 1) flag = 0;
				else if(ans[i] < ans[i - 1] && flag == -1) flag = 0;
		}
		return;
	}
	if(2 * v + 2 < n){
		dfs(2 * v + 2);
		ans.pop_back();
	}
	if(2 * v + 1 < n){
		dfs(2 * v + 1);
		ans.pop_back();
	}
}
int main(){
	scanf("%d", &n);
	t.resize(n);
	for(int i = 0; i  < n; ++i)	scanf("%d", &t[i]);
	flag = t[0] > t[1]? 1 : -1;
	dfs(0);
	if(flag == 1)	printf("Max Heap");
	else if(flag == -1) printf("Min Heap");
	else printf("Not Heap");
	return 0;
}