1147 Heaps (30 分) 堆的判断静态树

最新推荐文章于 2021-05-08 19:42:05 发布

原创最新推荐文章于 2021-05-08 19:42:05 发布 · 367 阅读

0 ·

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

PAT甲级题解专栏收录该内容

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

前两天刚写了一个静态树实现堆的代码，所以这个障碍不大，半小时左右写完，只是在最后调格式时有点小麻烦。

给出节点个数和一个完全二叉树的层序遍历结果，判断这个二叉树是不是堆，是大根堆还是小根堆，最后输出对这棵树后序遍历的结果。

我用递归写的堆检验，复杂度不太好分析，如果用堆检验的迭代写法，复杂度就好分析了。这个写法在pat a 1155题中也有写。

for (int i=2;i<=n;i++)	{	//从2开始，遍历i/2，省去了判断越界的麻烦
	if (a[i/2]>a[i])	mnh=0;		//如果根节点大于子节点，小根堆标志置0
	else if (a[i/2]<a[i])	mxh=0;		//如果根节点小于子节点，小根堆标志置1
}

测试过后发现在这里，递归和迭代的效率差不多。其实本来就应该差不多，都是O(n)复杂度。

#include <bits/stdc++.h>
#define N 1005
using namespace std;
void dfs(int a[],int be);
void postorder(int a[],int b);
int a[N],n,m,cnt=0;
bool mxh=1,mnh=1;
int main()  {
    scanf("%d%d",&m,&n);
    for (int i=0;i<m;i++)   {
        for (int i=1;i<=n;i++)   scanf("%d",a+i);
        dfs(a,1);
        if (mxh)    {
            if (!mnh)   printf("Max Heap\n");
            else printf("Not Heap\n");
        }
        else if (mnh)   printf("Min Heap\n");
        else printf("Not Heap\n");
        postorder(a,1);
        mxh=mnh=true;
        cnt=0;
    }
    return 0;
}

void postorder(int a[],int b)    {
    if (2*b>n&&2*b+1>n) {
        if (b<=n)   {
            printf("%d%c",a[b],cnt==n-1?'\n':' ');
            cnt++;
        }
        return;
    }
    postorder(a,2*b);
    postorder(a,2*b+1);
    printf("%d%c",a[b],cnt==n-1?'\n':' ');
    cnt++;
}

void dfs(int a[],int be)    {
    if (be>n)   return;
    if (2*be<=n)   {
        if (a[2*be]>a[be])  mxh=0;
        else if (a[2*be]<a[be]) mnh=0;
        dfs(a,2*be);
    }
    if (2*be+1<=n)  {
        if (a[2*be+1]>a[be])    mxh=0;
        else if (a[2*be+1]<a[be])  mnh=0;
        dfs(a,2*be+1);
    }
}