heap.cpp

二叉树

//
#include<iostream.h>
#include"heap.h"
void main()
{
	int array[]={14,10,23,20,2,15};
	MinHeap<int> maxhp;
	maxhp.makeMinTree(array,6);
	maxhp.PrintAll();
	maxhp.insertHeapNode(1);
	maxhp.PrintAll();
	cout<<"Delete heap from root:\n";
	maxhp.deleteHeapNode();
	maxhp.PrintAll();
}