链队列的初始化、插入和删除操作(C语言版)

#include

#define OK 1

#define ERROR 0

#define OVERFLOW -1

typedef struct QNode{

char data;

struct QNode *next;

}QNode,*QueuePtr;

typedef struct{

QueuePtr front;

QueuePtr rear;

} LinkQueue;

LinkQueue Q;

int main(){

int InitQueue(LinkQueue *Q);

int EnQueue(LinkQueue *Q,char e);

int DeQueue(LinkQueue *Q,char *e);

int QueueTraverse(LinkQueue Q);

int i;

char c,d,e,f;

char a[]="I am happy";

clrscr();

InitQueue(&Q);

for(i=0;a[i]!='\0';i++)

EnQueue(&Q, a[i]);

printf("The Queue is:\n");

QueueTraverse(Q);

do{

printf("If you want to insert , please press \"P\" delete press\"d\" else press any other key to exit\n");

scanf(" %c",&c);

switch(c){

case 'p':{

printf("Please input the elem you want to inset:\n");

scanf(" %c",&d);

EnQueue(&Q,d);

printf("\nThe Queue inserted is:\n");

QueueTraverse(Q);

break;

}

case'd':{

DeQueue(&Q,&e);

printf("The elem which is deleted is:%c\n",e);

break;

}

default:exit(1);

}

printf("Do you want to contune ?(Y/N)\n");

scanf(" %c",&f);

}while(f=='y');

}

InitQueue(LinkQueue *Q) {

(*Q).front=(*Q).rear=(QueuePtr)malloc(sizeof(QNode));

if(!(*Q).front) exit(OVERFLOW);

(*Q).front->next=NULL;

return OK;

}

EnQueue(LinkQueue *Q,char e){

QueuePtr p=(QueuePtr)malloc(sizeof(QNode));

if(!p) exit(OVERFLOW);

p->data=e;p->next=NULL;

(*Q).rear->next=p;

(*Q).rear=p;

return OK;

}

DeQueue(LinkQueue *Q,char *e){

QueuePtr 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;

}

int QueueTraverse(LinkQueue Q){

while(Q.front!=Q.rear){

printf("%c",Q.front->next->data);

Q.front=Q.front->next;

}

printf("\n");

return OK;

}