二叉堆

#include"stdio.h"           //最小二叉堆
#include"iostream"
using namespace std;
#define MAXN 1048576   //2^20

int n,HeapSize,Heap[MAXN+1];//从1开始
void HeapUp(int p)
{
	int q=p>>1,a=Heap[p];
	while(q){
		if(a<Heap[q]) Heap[p]=Heap[q];else break;
		p=q; q=p>>1;
	}
	Heap[p]=a;
}
void AddToHeap(int a) //从1开始
{
	Heap[++HeapSize]=a;
	HeapUp(HeapSize);
}
void HeapDown(int p)
{
	int q=p<<1,a=Heap[p];
	while(q<=HeapSize){
		if(q<HeapSize&&Heap[q+1]<Heap[q]) q++;
		if(Heap[q]<a) Heap[p]=Heap[q];else break;
		p=q;q=p<<1;
	}
	Heap[p]=a;
}
int GetTopFromHeap() //取出并且删除
{
	int TopElement=Heap[1];
	Heap[1]=Heap[HeapSize--];
	HeapDown(1);
	return TopElement;
}
void BuildHeap()
{ for(int i=HeapSize;i>0;i--) HeapDown(i);}
int main()
{
	/*
	AddToHeap(80);AddToHeap(40);AddToHeap(30);AddToHeap(60);
	AddToHeap(90);AddToHeap(70);AddToHeap(10);AddToHeap(50);
	AddToHeap(20);
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	cout<<"HeapSize:"<<HeapSize<<endl;
	AddToHeap(15);
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	cout<<GetTopFromHeap()<<endl;
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	*/

	
	int a[10]={0,80, 40, 30, 60, 90, 70, 10, 50, 20};
	HeapSize=9;
	for(int i=1;i<=HeapSize;i++)
		Heap[i]=a[i];
	BuildHeap();
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	AddToHeap(15);
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	cout<<GetTopFromHeap()<<endl;
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	
	return 0;
}

#include"stdio.h"           //最大二叉堆
#include"iostream"
using namespace std;
#define MAXN 1048576   //2^20

int n,HeapSize,Heap[MAXN+1];//从1开始
void HeapUp(int p)
{
	int q=p>>1,a=Heap[p];
	while(q){
		if(a>Heap[q]) Heap[p]=Heap[q];else break;//
		p=q; q=p>>1;
	}
	Heap[p]=a;
}
void AddToHeap(int a) //从1开始
{
	Heap[++HeapSize]=a;
	HeapUp(HeapSize);
}
void HeapDown(int p)
{
	int q=p<<1,a=Heap[p];
	while(q<=HeapSize){
		if(q<HeapSize&&Heap[q+1]>Heap[q]) q++;//
		if(Heap[q]>a) Heap[p]=Heap[q];else break;//
		p=q;q=p<<1;
	}
	Heap[p]=a;
}
int GetTopFromHeap() //取出并且删除
{
	int TopElement=Heap[1];
	Heap[1]=Heap[HeapSize--]; //删除
	HeapDown(1); //做回一个二叉堆
	return TopElement;
}
void BuildHeap()
{ for(int i=HeapSize;i>0;i--) HeapDown(i);}
int main()
{
	
	cout<<"依次添加:10 40 30 60 90 70 20 50 80"<<endl;
	AddToHeap(10);AddToHeap(40);AddToHeap(30);AddToHeap(60);
	AddToHeap(90);AddToHeap(70);AddToHeap(20);AddToHeap(50);
	AddToHeap(80);
	cout<<"最大堆:";
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	cout<<"HeapSize:"<<HeapSize<<endl;
	cout<<"添加元素:85"<<endl;
	AddToHeap(85);
	cout<<"最大堆:";
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	cout<<"删除堆顶元素:"<<GetTopFromHeap()<<endl;
	cout<<"最大堆:";
	for(int i=1;i<=HeapSize;i++) cout<<Heap[i]<<" ";
	cout<<endl;
	

	return 0;
}