【题解】【PAT甲】1155 Heap Paths (30 分)（堆）

题目链接

 PTA | 程序设计类实验辅助教学平台

题目描述

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

结尾无空行

题目大意

 给你个完全二叉树，判断是不是堆，然后输出每个根节点到叶子结点路径

解题思路

 没啥好注意的，和1147差不多【题解】【PAT甲】1147 Heaps (30 分)（堆）_Elephant_King的博客-CSDN博客

唯一要注意一下的就是dfs函数

void dfs(int x){
	if(x>n)	return ;
	path.push_back(v[x]);
	if(x*2>n){
		for(int i=0;i<path.size();i++){
			if(i!=0)	cout<<" ";
			cout<<path[i];
		}
		cout<<endl;
		path.pop_back();
		return ;
	}
	dfs(x*2+1);
	dfs(x*2);
	path.pop_back();
}

先判断节点在不在，然后再push，然后找到根节点和遍历完都要pop 

其他的也没啥要注意的了

题解

#include<bits/stdc++.h>
using namespace std;
vector<int> v;
vector<int> path;
int n;
void dfs(int x){
	if(x>n)	return ;
	path.push_back(v[x]);
	if(x*2>n){
		for(int i=0;i<path.size();i++){
			if(i!=0)	cout<<" ";
			cout<<path[i];
		}
		cout<<endl;
		path.pop_back();
		return ;
	}
	dfs(x*2+1);
	dfs(x*2);
	path.pop_back();
}
int main(){
	cin>>n;
	v.resize(n+1);
	for(int i=1;i<=n;i++){
		cin>>v[i];
	}
	int mmax=1,mmin=1;
	for(int i=2;i<=n;i++){
		if(v[i]>v[i/2])	mmax=0;
		if(v[i]<v[i/2])	mmin=0;
	}
	dfs(1);
	if(mmax==1)	cout<<"Max Heap"<<endl;
	else if(mmin==1)	cout<<"Min Heap"<<endl;
	else	cout<<"Not Heap"<<endl;
}