PAT 1147 Heaps (30分)

原题链接：1147 Heaps (30分)
关键词：dfs、堆、树的遍历
整理时间：2020.7.24

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 <vector>
#include <algorithm>
using namespace std;

const int N = 1010;
int lOrder[N];  //层序遍历
bool isMaxH, isMinH;

void DFS(int i, vector<int>& pOrder) {	//i当前结点编号
	if(i > n) return;
    if (i != 1) {
        //如果不是根节点，比较父节点与当前节点大小
        if (lOrder[i / 2] > lOrder[i]) {
            isMaxH = true;
        }
        else if (lOrder[i / 2] < lOrder[i]) {
            isMinH = true;
        }
    }
    //递归遍历左右子树
    DFS(i * 2, pOrder);
    DFS(i * 2 + 1, pOrder);
    //后续遍历，左右根
    pOrder.push_back(lOrder[i]);
}

int main() {
    int m, n;   //询问数 结点数
    scanf("%d%d", &m, &n);
    while (m--) {
        isMaxH = false;
        isMinH = false;
        
        for (int i = 1; i <= n; i ++ ) scanf("%d", &lOrder[i]);
        vector<int> pOrder;
        DFS(1, pOrder)
        
        //如果互相矛盾，则不是堆
        if (isMaxH && isMinH) puts("Not Heap");
        else if (isMaxH) puts("Max Heap");
        else puts("Min Heap");
        
        for (int i = 0; i < pOrder.size(); i++) {
            if (i) printf(" ");
            printf("%d", pOrder[i]);
        }
        printf("\n");
    }
    return 0;
}

柳神的代码很简单也巧妙：

#include <iostream>
using namespace std;
int a[1005], m, n;
void postOrder(int index) {	//输出后续遍历
	//index结点分别遍历孩子index*2和右孩子index*2+1，遍历完左右子树后输出根结点
    if (index > n) return;
    postOrder(index * 2);
    postOrder(index * 2 + 1);
    printf("%d%s", a[index], index == 1 ? "\n" : " ");
}
int main() {
    scanf("%d %d", &m, &n);
    while (m--) {
        int minn = 1, maxn = 1;	//不满足则置为0
        for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
        for (int i = 2; i <= n; i++) {
            if (a[i] > a[i / 2]) maxn = 0;
            if (a[i] < a[i / 2]) minn = 0;
        }
        if (maxn == 1) printf("Max Heap\n");
        else if (minn == 1) printf("Min Heap\n");
        else printf("Not Heap\n");
        postOrder(1);
    }
    return 0;
}