PAT甲级 1155 Heap Paths【堆 dfs】

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

---

题目大意：
给出一颗二叉树的层序遍历（the level order traversal）

首先输出所有从根到叶的路径（从右向左打印），然后输出这颗树是Max Heap还是Min Heap还是Not Heap

分析：
完全二叉树，不用建树，用数组模拟即可，此时可以如线段树一样，以用k<<1代表k*2，用k<<1|1代表k*2+1
打印过程用dfs

#include <iostream>
#include <vector>
using namespace std;

const int maxn = 1010;
int a[maxn];
int n;
vector<int> v;

void dfs(int cur)
{
    v.push_back(a[cur]);

    // 到达叶子结点或空节点
    if (cur<<1 > n)
    {
        // 到达叶子结点：打印
        if (cur <= n)
        {
            for (int i = 0; i < v.size(); i++)
                cout << v[i] << " \n"[i + 1 == v.size()];
        }
        return;
    }

    dfs(cur<<1|1);
    v.pop_back();
    dfs(cur<<1);
    v.pop_back();
    return;
}
int main()
{
    bool isMax = 1, isMin = 1;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (i > 1 && isMax && a[i] > a[i>>1])
            isMax = false;
        if (i > 1 && isMin && a[i>>1] > a[i])
            isMin = false;
    }

    dfs(1);
    if (isMax)
        cout << "Max Heap" << endl;
    else if (isMin)
        cout << "Min Heap" << endl;
    else
        cout << "Not Heap" << endl;
    return 0;
}