priorityqueue.h

数据结构

#ifndef _priorityQueue
#define _priorityQueue
template<class T>
class priorityQueue
{
 public:
    virtual void add(T value)=0;
    T deleteMin();
    virtual int isEmpty()const=0;
    virtual T min()const=0;
    virtual void removeMin()=0;
};

template<class T> T priorityQueue<T>::deleteMin()//优先队列
{
    T result=min();
    removeMin();
    return result;
}
#endif