链队列

#include<stdio.h>#define maxsize 50typedef struct{int data;    linknode *next;}linknode;typedef struct{linknode *front, *rear;}linkqueue;linkqueue q;void initqueue(linkqueue &q){q.front = q.rear = new linknode;q.front->next = NULL;//带头结点的链队列}bool isempty(linkqueue q){if (q.front == q.rear){return  true;}elsereturn false;}void enqueue(linkqueue &q, int x){linknode *s;s= new linknode;s->data = x;s->next = NULL;q.rear->next = s;q.rear = s;}bool dequeue(linkqueue &q){if (q.front == q.rear){return false;}q.front->next = q.front->next->next;return true;}