队列的链表储存结构及实现

//队列的链表有附加头指针，指向队列的第一个数据结点的前一位置
typedef int Elemtype;
struct quenode
{
	Elemtype data;
	quenode *next;
};

class LsQueue
{

private:
	quenode *front;
	quenode *rear;


public:

	LsQueue();
	~LsQueue();
	int IsEmpty();              //判断是否为空
	void Display();				//输出队列元素
	void AddQ(Elemtype x);		//入队
	Elemtype DelQ();			//出队
	Elemtype GetFront();		//输出队顶
}

//构造函数  初始化一个空队列
LsQueue::LsQueue()
{
	quenode *p;
	p = new quenode;
	p->next = NULL;
	front = rear = p;
}

//判断队列是否为空

LsQueue::~LsQueue()
{
	quenode *p;
	if(front->next !=NULL)   //加判断 如果已经是空队列，即front->next ==NULL  则不能再析构
	{ 
		p = front->next;
		while (p != NULL)
		{
			front->next = p->next;
			delete p;
			p = front->next;
		}
		delete front;
		delete rear;
		rear = front = NULL;
	}

}

int LsQueue::IsEmpty()
{
	if (front == rear)
		return 1;
	else
		return 0;
}


//取队首元素 不出队
Elemtype LsQueue::GetFront()
{
	Elemtype x;
	quenode *p;
	if (front == rear)
	{
		cout << "\n Queu Is Empty " << endl;
		x = -1;
	}
	else
	{
		p = front->next;
		x = p->data;
	}
	return x;
}


//入队
void LsQueue::AddQ(Elemtype x)
{
	quenode *s;
	s = new quenode;
	s->data = x;
	s->next = NULL;
	rear->next = s;
	rear = s;
}

//出队操作  在队头进行
Elemtype LsQueue::DelQ()
{
	Elemtype x;
	quenode *p;
	if (front == rear)
	{
		cout << "\n  队列为空" << endl;
		x = -1;
	}
	else
	{
		p = front->next;
		front->next = p->next;
		if (p->next == NULL)       //此时表明队列链表只有一个元素  删除后头尾指针重合
			rear = front;		   //防止尾指针丢失
		x = p->data;
		delete p;
	}
	return x;

}

void LsQueue::Display()
{
	quenode *p;
	p = front->next;
	while (p !=NULL)
	{
		cout << "\n 元素:" << p->data << endl;;
		p = p->next;
	}
	cout << "结束" << e
}

int main()
{
	Elemtype e;
	LsQueue Q;
	cout << "\n 队列链式存储结构演示";
	cout << "进队 data= ?"; cin >> e;
	Q.AddQ(e);
	Q.Display();
	e = Q.DelQ();
	Q.Display();


    std::cout << "Hello World!\n"; 
}