二叉树之堆

https://blog.csdn.net/liuchuo/article/details/84973009

#include<iostream>
#include<vector>
using namespace std;
vector<int> v;
int a[1001], n, isMin = 1, isMax = 1;
void dfs(int index) {
	if(index * 2 > n && index * 2 + 1 > n) {    //退出条件 
		if(index <= n) {
			for(int i = 0; i < v.size(); i++)
			printf("%d%s", v[i], i != v.size() - 1 ? " " : "\n");
		}
	}
	else {     //向下搜索 
		v.push_back(a[index * 2 + 1]);
		dfs(index * 2 + 1);
		v.pop_back();
		v.push_back(a[index * 2]);
		dfs(index * 2);
		v.pop_back();
	}
}
int main() {
	cin >> n;
	for(int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	v.push_back(a[1]);
	dfs(1);
	for(int i = 2; i <= n; i++){
		if(a[i / 2] > a[i]) isMin = 0;
		if(a[i / 2] < a[i]) isMax = 0;
 	}
 	if(isMin == 1) cout << "Min Heap";
 	else printf("%s", isMax ==  1 ? "Max Heap" : "Not Heap");
	return 0;
}