停车厂管理系统数据结构与算法设计VIP免费

停车厂管理系统数据结构与算法设计队列代码：#ifndef LinkedQueue_#define LinkedQueue_#include "node

h"#include "xcept

h"templateclass LinkedQueue { public: LinkedQueue() {front = rear = 0,pos=0;} ~LinkedQueue(); LinkedQueue& Add(T& x,T& y); LinkedQueue& Delete(T& x,T& y);/********************************************/ int Position() { return pos; } //得到车在队列中的位置 private: Node *front; Node *rear; int pos;/**************************************************/};templateLinkedQueue::~LinkedQueue(){// Queue destructor

Delete all nodes

Node *next; while (front) { next = front->link; delete front; front = next; }}templateLinkedQueue& LinkedQueue::Add(T& x,T& y){ Node *p = new Node; p->data=x; p->time=y; p->link=0; pos++; if (front) { rear->link = p; } else front = p; rear = p; return *this;}templateLinkedQueue& LinkedQueu