数据结构最大堆的模板实现 c++ 存储方法是数组

/* 作者:臧旭 日期:2010.12.25 */ #include "MaxHeap.h" void main() { cout << "建立一个空的最大堆" << endl; MaxHeap< int > h; cout << "当前堆中元素为: " << h; cout << endl; cout << "向堆中连续的添加15,13,8,10,11,7这6个元素" << endl; h.Insert(Element<int>(15)); h.Insert(Element<int>(13)); h.Insert(Element<int>(8)); h.Insert(Element<int>(10)); h.Insert(Element<int>(11)); h.Insert(Element<int>(7)); cout << "当前堆中元素为: " << h << endl; cout << "继续向堆中插入14" << endl; h.Insert(Element<int>(14)); cout << "当前堆中元素为: " << h << endl; cout << "从堆中连续删除8个元素:" << endl; for (int i = 0; i < 7; i++) { Element<int> * e = new Element<int>(); e = h.Delete(*e); if (e) { cout << "从堆中删除元素 " << e->key; cout << ". 当前堆中元素为: " << h << endl; } delete e; } cout << endl; }