PAT A1147 2019.08.12 【层序完全二叉树性质建树 堆 后序遍历】

1147 Heaps (30 分)

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

思路分析

2019.09.03重做后更新

层序完全二叉树性质建树

完全二叉树性质判堆

最后后序遍历（输出格式控制的输出次数time定义为其他，若定义为time则提交时会发生编译错误）

也可以不建树直接做

但是后序遍历需要想一想，就直接建树做了

另外判断堆的代码最好写到主函数里面，写成函数不好控制

#include<cstdio>
#include<iostream>
#include<vector>
#define maxHeap 1
#define minHeap 2
#define notHeap 3
using namespace std;
int flag;
int m,n;
int t=0;

typedef struct NODE{
	int data;
	struct NODE *left;
	struct NODE *right;
}NODE;

void postorder(NODE *root)
{
	if(root==NULL)return;
	postorder(root->left);
	postorder(root->right);
	cout<<root->data;t++;
	if(t!=n)cout<<" ";
}

int main()
{
	cin>>m>>n;
	for(int j=0;j<m;j++)
	{
		vector<NODE*>node;
		for(int i=0;i<n;i++)
		{
			NODE *newNode = new NODE;
			newNode->left=NULL;
			newNode->right=NULL;
			cin>>newNode->data;
			node.push_back(newNode);
		}
		for(int i=0;i<n;i++)
		{
			if((2*i+1)<n)node[i]->left=node[2*i+1];
			if((2*i+2)<n)node[i]->right=node[2*i+2];
		}
		NODE *root=node[0];
		t=0;
		
		if(root->data>root->left->data)flag=maxHeap;
		if(root->data<root->left->data)flag=minHeap;
		if(flag==maxHeap)
		{
			for(int i=0;i<n;i++)
			{
				if((2*i+1)<n)if(node[i]->data<node[2*i+1]->data)flag=notHeap;
				if((2*i+2)<n)if(node[i]->data<node[2*i+2]->data)flag=notHeap;
			}
		}
		else if(flag==minHeap)
		{
			for(int i=0;i<n;i++)
			{
				if((2*i+1)<n)if(node[i]->data>node[2*i+1]->data)flag=notHeap;
				if((2*i+2)<n)if(node[i]->data>node[2*i+2]->data)flag=notHeap;
			}
			
		}
		
		if(flag==maxHeap)cout<<"Max Heap"<<endl;
		if(flag==minHeap)cout<<"Min Heap"<<endl;
		if(flag==notHeap)cout<<"Not Heap"<<endl;
		postorder(root);cout<<endl;		
	}	
}