1147_heaps树的遍历大顶堆小顶堆的判断

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
结尾无空行

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
//三种遍历 前序：中左右，中序：左中右，后序：左右中 
using namespace std;
int m,n;
vector<int> lev;
void dfs(int index)
{
	if(index>n) return;
	dfs(index*2); //左子树 
	dfs(index*2+1); //右子树 
	printf("%d%s",lev[index],index == 1?"\n":" ");
	
}
int main()
{
	cin>>m>>n;
	lev.resize(n+1); 
	for(int i = 0;i<m;i++)
	{
		lev.clear();
		for(int j = 1;j<=n;j++)
			cin>>lev[j];
	int isMin=1,isMax=1; //大顶堆和小顶堆的标志 
	for(int j = 2;j<=n;j++){
		if(lev[j/2]>lev[j]) isMin = 0;
		if(lev[j/2]<lev[j]) isMax = 0;
	}
	if(isMin==1) printf("Min Heap\n");
	else printf("%s",isMax==1?"Max Heap\n":"Not Heap\n");
	dfs(1); //将中序遍历变为后续遍历 
	}
	return 0;
}