【数据结构模板】二叉堆

#include<cstdio>
#include<iostream>
using namespace std;
#define MAX 100000
typedef unsigned long long ll;
int parent(int i){
	return i/2;
}
int left(int i){
	return 2*i;
}
int right(int i){
	return 2*i+1;
} 
int main(){
	int H,i,A[MAX+1];
	
	cin>>H;
	
	for(i=1;i<=H;i++)	cin>>A[i]; 
	
	for(i=1;i<=H;i++)
	{
		cout<<"node "<<i<<' '<<':'<<endl; 
		cout<<"key="<<A[i]<<endl;
		cout<<"parent key="<<A[parent(i)]<<endl;
		cout<<"left key="<<A[left(i)]<<endl;
		cout<<"right key="<<A[right(i)]<<endl;
		cout<<endl; 
	}
	return 0;
}

/*
input:
10
25 12 9 6 8 5 4 3 2 1
output:
node 1 :
key=25
parent key=0
left key=12
right key=9

node 2 :
key=12
parent key=25
left key=6
right key=8

node 3 :
key=9
parent key=25
left key=5
right key=4

node 4 :
key=6
parent key=12
left key=3
right key=2

node 5 :
key=8
parent key=12
left key=1
right key=0

node 6 :
key=5
parent key=9
left key=0
right key=0

node 7 :
key=4
parent key=9
left key=0
right key=0

node 8 :
key=3
parent key=6
left key=0
right key=0

node 9 :
key=2
parent key=6
left key=0
right key=0

node 10 :
key=1
parent key=8
left key=0
right key=0
*/