# 题目

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.

# 题解

## 思路

• 堆其实是一种很简单的数据结构
• 这就意味着，所有节点下标的*2即它的左孩子下标,*2+1即它的右孩子的下标。
• 这题就分为两步
• 判断是大顶堆小顶堆还是不是堆
• 就遍历每个节点，判断它和它父亲的关系即可
• 后序遍历
• 递归即可

## 数据结构

• heap 是我们的堆
• isMax 判断是否是大顶堆
• 呃，好像没了

## 算法

• 就照着思路里的写就行了
• 后序遍历是先左后右后根，照着这样写就可以了。处理一下边界条件即可。

## 代码

• 由于使用Python可以AC，因此只放了Python的解。