queue.cpp

来自「有关树的遍历问题」· C++ 代码 · 共 50 行

#include<iostream>

using namespace std;

Status InitQueue(LinkQueue & Q)
{
	Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
	if(!Q.front)
		exit(OVERFLOW);
	Q.front->next=NULL;
	return OK;
}

Status DelQueueLinkQueue & Q,QElemType &e)
{	if(Q.front==Q.rear)return ERROR;
	p=Q.front->next;
	e=p->data;
	Q.front->next=p->next;
	if(Q.rear==p)Q.rear=Q.front;
	free(p);
	return OK;
}

Status EnterQueue(LinkQueue & Q,QElemType e)
{
	p=(QueuePtr)malloc(sizeof(QNode));
	if(!p)
		exit(OVERFLOW);
	p->data=e;
	p->next=NULL;
	Q.rear->next=p;
	Q.rear=p;
	return OK;
}

int Empty(Queue & Q)
{
    return Q.front==Q.rear;
}

visite(v)
{
	if(v)
		return Q;
	else 
		return ERROR;

}