【PAT甲级A1147】Heaps (30分)（c++）

最新推荐文章于 2023-08-25 13:28:51 发布

原创最新推荐文章于 2023-08-25 13:28:51 发布 · 234 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#数据结构

pat 专栏收录该内容

152 篇文章

订阅专栏

博客围绕1147 Heaps题目展开，要求判断给定层序输出的完全二叉树是大顶堆、小顶堆还是非堆，并进行后序输出。思路是先根据完全二叉树下标性质构建树，用dfs深度优先比较根与子结点大小，最后后序输出树。

1147 Heaps (30分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

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

题意：

给一颗层序输出的完全二叉树，判断它是否是大顶堆还是小顶堆还是啥也不是，并将该树后序输出。

思路：

首先根据完全二叉树下标的性质构建树。然后利用dfs深度优先去计算比较根结点与子结点的大小次数，若根结点比子结点大的次数为n-1，则每个结点满足根结点比子结点大，它是大顶推，同理若根结点比子结点小的次数为n-1则为小顶堆，不然啥也不是。最后后序输出树。

参考代码：

#include <cstdio>
#include <vector>

using namespace std;

struct node {
    int val;
    node *left, *right;
    node(int data) : val(data), left(NULL), right(NULL) {}
};

int n, m, maxheap, minheap, cnt;
vector<int> v;

node *creat(int index) {
    if (index >= n)return NULL;
    node *root = new node(v[index]);
    root->left = creat(index * 2 + 1);
    root->right = creat(index * 2 + 2);
    return root;
}

void dfs(node *root) {
    if (root->left != NULL) {
        if (root->val > root->left->val)maxheap++;
        else minheap++;
        dfs(root->left);
    }
    if (root->right != NULL) {
        if (root->val > root->right->val)maxheap++;
        else minheap++;
        dfs(root->right);
    }
}

void postorder(node *root) {
    if (root == NULL)return;
    postorder(root->left);
    postorder(root->right);
    if (cnt != 0)printf(" ");
    printf("%d", root->val);
    cnt++;
}

int main() {
    scanf("%d%d", &m, &n);
    v.resize(n);
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++)scanf("%d", &v[j]);
        node *root = creat(0);
        maxheap = minheap = cnt = 0;
        dfs(root);
        if (maxheap == n - 1)printf("Max Heap\n");
        else if (minheap == n - 1)printf("Min Heap\n");
        else printf("Not Heap\n");
        postorder(root);
        printf("\n");
    }
    return 0;
}

如有错误，欢迎指正。