数据结构试验报告--队列操作.docxVIP

队列操作：链表队列代码：#includeiostream.h#includemalloc.h#includestring.h#define ERROR 0#define OK 1typedef struct QNode{int data;struct QNode *next;}QNode,*QueuePtr;typedef struct{QueuePtr front;QueuePtr rear;}LinkQueue;int InitQueue(LinkQueue Q){Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));if(!Q.front) return ERROR;Q.front-next=NULL;return OK;}int EnQueue(LinkQueue Q,int e){QNode *p;p=(QueuePtr)malloc(sizeof(QNode));if(!p) return ERROR; p-data=e; p-next=NULL; Q.rear-next=p; Q.rear=p;return OK;}int DeQueue(LinkQueue Q,int e){QNode *p;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;}void main(){LinkQueue Q;int e,i;if(InitQueue(Q)) cout已创建了一个队列endl;elsecout创建队列失败endl;for(i=0;i=2;i++){cout输入要进队的元素endl;cine; EnQueue(Q,e);}DeQueue(Q,e);cout删除的队首元素值为：eendl;}运行结果：循环列表代码：#includestdio.h#includemalloc.h#includeiostream.h#define ERROR 0#define OK 1#define MAXSIZE 100typedef struct{ int *base; int front; int rear;}SqQueue;int InitQueue(SqQueue Q){Q.base=(int*)malloc(MAXSIZE*sizeof(int));if(!Q.base) return ERROR;Q.front=Q.rear=0;return OK;}int EnQueue(SqQueue Q,int e){if((Q.rear+1)%MAXSIZE==Q.front) return ERROR;Q.base[Q.rear+1]=e;Q.rear=(Q.rear+1)%MAXSIZE;return OK;}int DeQueue(SqQueue Q,int e){if(Q.front==Q.rear) return ERROR;e=Q.base[Q.front+1];Q.front=(Q.front+1)%MAXSIZE;return OK;}void main(){SqQueue Q;int e,i;if(InitQueue(Q))cout创建成功endl;elsecout创建失败endl;for(i=0;i=2;i++){cout请输入要进队的元素endl;cine;EnQueue(Q,e);}DeQueue(Q,e);cout删除的队首元素值为eendl;}运行结果：