1155 Heap Paths (30分)---Heap

https://pintia.cn/problem-sets/994805342720868352/problems/1071785408849047552

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:

8
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
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:

8
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

我写的，直接从最右的叶子节点开始然后一次向左打印路径，最后判断是否是大顶堆或者小顶堆

#include<bits/stdc++.h>
using namespace std;
vector<int>heap;
void judge(){
	int flag1=0;
	for(int i=heap.size()-1;i>1;i--){
		if(heap[i]>heap[i/2])flag1++;
		else flag1--;
	}
	if(flag1==heap.size()-2)printf("Min Heap");
	else if(flag1==2-heap.size())printf("Max Heap");
	else printf("Not Heap"); 
}
int main(){
	int N;
	scanf("%d",&N);
	heap.resize(N+1);
	for(int i=1;i<=N;i++){
		scanf("%d",&heap[i]);
	} 
	int i=1;
	while(i*2<=N-1){
		i=i*2+1;
	}
	for(int t=i;t>N/2;t--){
		stack<int>s;
		int q=t;
		while(q>0){
			s.push(heap[q]);
			q/=2;
		}
		while(!s.empty()){
			if(s.size()!=1)printf("%d ",s.top());
			else printf("%d",s.top());
			s.pop();
		}
		printf("\n");
	}
	for(int t=N;t>i;t--){
		stack<int>s;
		int q=t;
		while(q>0){
			s.push(heap[q]);
			q/=2;
		}
		while(!s.empty()){
			if(s.size()!=1)printf("%d ",s.top());
			else printf("%d",s.top());
			s.pop();
		}
		printf("\n");
	}
	judge();
}

别人写的， 给出一棵完全二叉树，打印出从根节点到所有叶节点的路径，打印顺序先右后左，即先序遍历的镜像。然后判断树是大顶堆还是小顶堆或者不是堆。深搜打印出所有路径

#include<bits/stdc++.h>
using namespace std;
vector<int> v;
int a[1009], N, minHeap = 1, maxHeap = 1;
void dfs(int index) {
	if (index * 2 > N && index * 2 + 1 > N) { //判断是否还有子节点
		if (index <= N) {	//减去只有左节点没有右节点的情况
			for (int i = 0; i < v.size(); i++) {
				if (i != 0) printf(" ");
				printf("%d", v[i]);
			}
			printf("\n");
		}
	} else {
		v.push_back(a[index * 2 + 1]);
		dfs(index * 2 + 1);
		v.pop_back();
		v.push_back(a[index * 2]);
		dfs(index * 2);
		v.pop_back();
	}
}
int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) {
		scanf("%d", &a[i]);
	} 
	v.push_back(a[1]);
	dfs(1);
	for (int i = 2; i <= N; i++) {
		if (a[i / 2] > a[i]) minHeap = 0;
		if (a[i / 2] < a[i]) maxHeap = 0;
	}
	if (minHeap == 1) {
		printf("Min Heap");
	} else {
		maxHeap == 1 ? printf("Max Heap") : printf("Not Heap");
	}
}