数据结构之二叉堆

#ifndef BINARYHEAP_H
#define BINARYHEAP_H
namespace binaryheap
{
template <typename Element>
class BinaryHeap
{
private:
Element* head;
int tail;
int size;
public:
BinaryHeap(int s){head = new Element[s];tail=-1;size=s;}
~BinaryHeap(){delete [] head;}
bool IsFailed(){return head?false:true;}//判断堆是否创建成功
void MaxHeapAdjustDown(Element* h,int start,int end);//向下调整最大堆
void MaxHeapAdjustUp(Element* h,int end);//向上调整最大堆
void AdjustMaxHeap(Element* h,int end);//把数组中的元素调整为最大堆
bool InsertElement(Element data);//在堆中插入元素
bool DecreaseKeyValue(int pos,int differ);//降低给定位置的值
bool IncreaseKeyValue(int pos,int differ);//增加给定位置的值
bool RemoveBigElement(Element* data);//移除堆顶端元素
void SmallToBigSort();//把最大堆从小到大排序
void AdjustMaxHeap();
void Show();
};
template <typename Element>
void BinaryHeap<Element>::MaxHeapAdjustDown(Element* h,int start,int end)
{
Element tem = h[start];
int i = 2*start+1;
while(i<=end)
{
if((i+1<=end)&&(h[i]<h[i+1]))
i++;
if(h[i]<=tem)
break;
h[start] = h[i];
start = i;
i = 2*start + 1;
}
h[start] = tem;
}
template <typename Element>
void BinaryHeap<Element>::MaxHeapAdjustUp(Element* h,int end)
{
Element tem = h[end];
int i = (end-1)/2;
while(end!=0)
{
if(h[i]>=tem)
break;
h[end] = h[i];
end = i;
i = (end-1)/2;
}
h[end] = tem;
}
template <typename Element>
void BinaryHeap<Element>::AdjustMaxHeap(Element* h,int end)
{
for(int i=(end-1)/2;i>=0;i--)
MaxHeapAdjustDown(h,i,end);
}
template <typename Element>
bool BinaryHeap<Element>::InsertElement(Element data)
{
if(tail+1==size)
return false;
tail++;
head[tail] = data;
MaxHeapAdjustUp(head,tail);
return true;
}
template <typename Element>
bool BinaryHeap<Element>::DecreaseKeyValue(int pos,int differ)
{
if(pos<0||pos>tail)
return false;
head[pos] -= differ;
MaxHeapAdjustDown(head,pos,tail);
return true;
}
template <typename Element>
bool BinaryHeap<Element>::IncreaseKeyValue(int pos,int differ)
{
if(pos<0||pos>tail)
return false;
head[pos] += differ;
MaxHeapAdjustUp(head,pos);
return true;
}
template <typename Element>
bool BinaryHeap<Element>::RemoveBigElement(Element* data)
{
if(tail==-1)
return false;
if(data != NULL)
*data = head[0];
head[0] = head[tail];
tail--;
MaxHeapAdjustDown(head,0,tail);
return true;
}
template <typename Element>
void BinaryHeap<Element>::SmallToBigSort()
{
Element tem;
for(int i=tail;i>0;i--)
{
tem = head[i];
head[i] = head[0];
head[0] = tem;
MaxHeapAdjustDown(head,0,i-1);
}
}
template <typename Element>
void BinaryHeap<Element>::AdjustMaxHeap()
{
AdjustMaxHeap(head,tail);
}
template <typename Element>
void BinaryHeap<Element>::Show()
{
for(int i=0;i<=tail;i++)
cout<<head[i]<<" ";
cout<<endl;
}
}
#endif