优先队列（二叉堆）模板(template)

template<class T,int MAX=100003>
class BinaryHeap
{
    private:
    int Size;
    T * Tarr;
    public:
    BinaryHeap();
    void insert(T x);
    T deleteMin();
    ~BinaryHeap();
};

template<class T,int MAX>
BinaryHeap::BinaryHeap()
{
    Tarr=new T[MAX+1];
    if(Tarr==NULL) {cout<<"创建数组失败"<return ;}
    Size=0;
}
template<class T,int MAX>
void BinaryHeap::insert(T x)
{
    ++Size;
    if(Size==MAX) return;
    int i;
    for(i=Size;Tarr[i/2]>x;i/=2)
        Tarr[i]=Tarr[i/2];
    Tarr[i]=x;
}
template<class T,int MAX>
T BinaryHeap::deleteMin()
{
    if(Size==0) return 0;
    T minem=Tarr[1];
    T lastem=Tarr[Size--];
    int i,child;
    for(i=1;i*2<=Size;i=child)    
    {
        child=i*2;
        if(child!=Size-1&&Tarr[child+1]if(lastem>Tarr[child])
            Tarr[i]=Tarr[child];
        else
            break;

    }
    Tarr[i]=lastem;

    return minem;
}

template<class T,int MAX>
BinaryHeap::~BinaryHeap()
{
    delete[] Tarr;
}

from C小加