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

 大意：给出一个堆的层序遍历，堆也是一个完全二叉树，父节点的值比孩子节点值大的堆为max Heap，反之为min Heap。首先判断是max Heap还是min Heap，然后输出堆的后序遍历。

一刷：柳：

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int n;
vector<int> v;
void postorder(int root)
{
	if (root>n)
	{
		return;
	}
	postorder(root * 2);
	postorder(root * 2 + 1);
	printf("%d%s", v[root], root == 1 ? "\n" : " ");
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int m;
	cin >> m >> n;
	v.resize(n + 1);
	for (int i = 0; i < m; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			cin >> v[j];
		}
		int flag = v[1] > v[2] ? 1 : 2;
		for (int j = 1; j <= n/2; j++)
		{
			int left = j * 2, right = j * 2 + 1;
			if (flag==1&&(v[j]<v[left]||(right<n&&v[j]<v[right])))
			{
				flag = 0;
			}
			if (flag==2&&(v[j]>v[left]||(right<n&&v[j]>v[right])))
			{
				flag = 0;
			}
		}
		if (flag==0)
		{
			cout << "Not Heap" << endl;
		}
		else if (flag==1)
		{
			cout << "Max Heap" << endl;
		}
		else
		{
			cout << "Min Heap" << endl;
		}
		postorder(1);
	}
	return 0;
}

二刷：吾：ismax和ismin定义在了错误的位置，判断不同堆的时候，ismax和ismin没有初始化，还是上次判断后的值，小细节烦人啊。要细心

#include <iostream>
#include <vector>

using namespace std;

int m, n;

vector<int> v,output;
void postorder(int index)
{
	if (index>n)
	{
		return;
	}
	/*if (index * 2 > n)  此if语句可以省略 不影响
	{
		output.push_back(v[index]);
		return;
	}*/
	postorder(index * 2);	
	postorder(index * 2+1);
	output.push_back(v[index]);
}

int main()
{
	//freopen("in.txt", "r", stdin);	
	cin >> m >> n;	
	for (int i = 0; i < m; i++)
	{
		int ismax = 1, ismin = 1;
		v.resize(n + 1);
		for (int j = 1; j <= n; j++)
		{
			cin >> v[j];
		}
		for (int j = 2; j <= n; j++)
		{
			if (v[j]>=v[j/2])
			{
				ismax = 0;				
			}
			else if (v[j] <= v[j / 2])
			{
				ismin = 0;				
			}
		}		
		if(ismax==0&&ismin==0)
		{
			cout << "Not Heap" << endl;
		}
		else 
		{
			printf("%s Heap\n", (ismax == 0) ? "Min" : "Max");
		}
		output.clear();
		postorder(1);
		cout << output[0];
		for (int i = 1; i < output.size(); i++)
		{
			cout << " " << output[i];
		}
		cout << endl;
	}
	return 0;
}