(一)静态队列
数据结构:
typedef struct Node
{
int date;
struct Node *next;
}Node, *PNode;
typedef struct queue
{
PNode top;
PNode bottom;
}Queue, *PQueue;
(1)初始化
void InitQueue(Queue *queue)
{
queue->top = 0;
queue->bottom = 0;
}
(2)入栈
void Push(Queue *queue, int date)
{
if ((queue->top +