struct

(QNode*)malloc(sizeof(QNode));if

(newnode

{assert(pq);assert(!QueueEmpty(pq));if

(pq-head-next

pq-head-next;free(pq-head);pq-head

next;}pq-size--;

{assert(pq);assert(!QueueEmpty(pq));return

pq-head-data;

{assert(pq);assert(!QueueEmpty(pq));return

pq-tail-data;

(MyStack*)malloc(sizeof(MyStack));QueueInit(pst-q1);QueueInit(pst-q2);return

pst;

(!QueueEmpty(obj-q1)){QueuePush(obj-q1,

x);}

QueueFront(nonempty));QueuePop(nonempty);}int

top

QueueFront(nonempty);QueuePop(nonempty);return

top;

{QueueDestroy(obj-q1);QueueDestroy(obj-q2);free(obj);

用栈实现队列

(MyQueue*)malloc(sizeof(MyQueue));STInit(pqueue-StackPush);STInit(pqueue-StackPop);return

pqueue;

(!STEmpty(obj-StackPush)){STPush(obj-StackPop,

STTop(obj-StackPush));STPop(obj-StackPush);}}return

myQueuePop(MyQueue*

myQueuePeek(obj);STPop(obj-StackPop);return

front;

{STDestroy(obj-StackPush);STDestroy(obj-StackPop);free(obj);

设计循环队列

MyCircularQueue;MyCircularQueue*

{MyCircularQueue*

(MyCircularQueue*)malloc(sizeof(MyCircularQueue));obj-a

obj-rear

myCircularQueueIsEmpty(MyCircularQueue*

obj)

myCircularQueueIsFull(MyCircularQueue*

obj)

myCircularQueueEnQueue(MyCircularQueue*

obj,

(myCircularQueueIsFull(obj)){return

(obj-k

myCircularQueueDeQueue(MyCircularQueue*

obj)

(myCircularQueueIsEmpty(obj)){return

(obj-k

myCircularQueueFront(MyCircularQueue*

obj)

(myCircularQueueIsEmpty(obj)){return

-1;}else{return

myCircularQueueRear(MyCircularQueue*

obj)

(myCircularQueueIsEmpty(obj)){return

-1;}else

myCircularQueueFree(MyCircularQueue*

obj)

(STEmpty(st)){STDestroy(st);return

false;}char

STEmpty(st);STDestroy(st);return

ret;