队列的顺序与链式存储结构

#include <iostream>

using namespace std;

int count=0;

class Node
{
public:
Node *next;
char data;
};

class CirQueue
{
public:
void Clear();
void Get();
void Out();
void Enter(char x);
CirQueue();
virtual ~CirQueue();
private:
Node *rear;
Node *front;
};

CirQueue::CirQueue()
{
front = new Node;

front->next=NULL;
rear=front;
}

void CirQueue::Enter(char x)
{
Node *s=new Node;
s->data=x;
s->next=NULL;
rear->next = s;
rear=s;
count++;
}

void CirQueue::Out()
{
Node *s=front;
if (rear == front)
{
cout << "None" <<endl;
return ;
}

else
{
s=front->next;
if (s->next == NULL)
{
front->next=rear->next;
rear=front;