无序双向优先队列

typedef  struct pqspa {it     PNode header,tail;next }*PQ;di PQ PQinit()co {header     PQ pq = (PQ)malloc(sizeof(&pq));let     if (!pq)data     {return         cout<<"PQ create failed!!!"<<endl;void  

>>阅读原文<<