数据结构优先队列链表实现

《数据结构优先队列链表实现》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、链表实现代码：#includeusingnamespacestd;constintSIZE=50;classNode{public:Node(){pre=NULL;next=NULL;}intvalue;Node*pre;Node*next;};classPQueue{public:PQueue();boolempty()const;boolfull()const;voidpop();voidpush(intp);intsize()const;Node*top();voiddisplay();private:Node*front,*back;intcount

2、;};PQueue::PQueue(){front=NULL;back=NULL;count=0;}boolPQueue::empty()const{if(front==NULL)returntrue;elsereturnfalse;}voidPQueue::pop(){if(empty())cout<<"队列为空！"<next;t->pre=NULL;front=t;}else{p->pre->next

3、=p->next;p->next->pre=p->pre;}count--;}}voidPQueue::push(intp){if(empty()){Node*newNode1=newNode();newNode1->value=p;front=newNode1;Node*newNode2=newNode();newNode2->pre=front;back=newNode2;front->next=newNode2;count++;}else{Node*newNode=newNode();back->value=p;newNode->pre=back;back->next=n

4、ewNode;back=newNode;count++;}}intPQueue::size()const{returncount;}Node*PQueue::top(){Node*max=front;Node*temp=front;while(temp->next!=NULL){if(temp->value>max->value)max=temp;temp=temp->next;}returnmax;}voidPQueue::display(){if(empty())cout<<"队列为空！"<

5、mp->next!=NULL){if(i++%5==0)cout<value<<"";temp=temp->next;}cout<>t;if(t==1){inttemp;printf("请输入数据：");cin>>temp;q.push(temp);}elseif(t==2){q.pop();}elseif(t==3){q.display

6、();}elsecout<<"请重新输入："<