1147 Heaps

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 <bits/stdc++.h>

using namespace std;
int n,m,cnt=0;

vector<int>heap;
bool Max_judge(int i){
    if(i>n)return true;
    if((i*2<=n&&heap[i*2]>heap[i])||(i*2+1<=n&&heap[i*2+1]>heap[i]))return false;
    return Max_judge(i*2)&&Max_judge(i*2+1);
}
bool Min_judge(int i){
    if(i>n)return true;
    if((i*2<=n&&heap[i*2]<heap[i])||(i*2+1<=n&&heap[i*2+1]<heap[i]))return false;
    return Min_judge(i*2)&&Min_judge(i*2+1);
}
void postorder(int i){
    if(i>n)return;
    postorder(i*2);
    postorder(i*2+1);
    if(cnt==0){printf("%d",heap[i]);cnt++;}
    else printf(" %d",heap[i]);
}


int main(){
    scanf("%d %d",&m,&n);
    heap.resize(n+1);
    for(int i=0;i<m;i++){
        bool f=false,s=false;
        for(int j=1;j<=n;j++)
            scanf("%d",&heap[j]);
        if(heap[1]>heap[2])f=Max_judge(1);
        else s= Min_judge(1);
        if(f)printf("Max Heap\n");
        else if(s)printf("Min Heap\n");
        else printf("Not Heap\n");
        cnt=0;
        postorder(1);
        printf("\n");
    }
    return 0;
}