假設以不帶頭結點的迴圈連結串列表示佇列，並且只是一個指標指向隊尾結點。當不是頭指標。試設計相應的入隊和出隊演算法。
迴圈佇列入隊演算法 Enqueue
template
void EnqueucCNode *rear,T x)
{
s= new Node;
S->data= x;
if (rear一NULL) {
rear= S;
rear->next= s;
}
else {
S-> next = rear->next;
rear->next= s;
rear= S;
}
}
迴圈隊列出隊演算法 Dequeue
template
T Dequeue(Node *rear)
{
if (rear == NULL) throw “underflow”;
else {
S= rear- next;
if(s= rear) rear= NULL;
else rear- next = s->next;
delete s;
}
}