数据结构第三章栈与队列：链队列

//数据结构 第三章栈与队列 链队列
//2021.8.13
//by Walnut from NWU
/*
* 队列：允许插入为队尾，允许删除为队头
* 先进先出表FIFO
* 操作：初始化，判空，判满，入队，出队，读队头，清空
*/
#include<iostream>
#include<stack>
#include<cmath>
#define MAXSIZE 30
using namespace std;

typedef struct Node {
    int data;
    Node* next;
}LinkQueueNode;

typedef struct LinkNode{
    LinkQueueNode* front;
    LinkQueueNode* rear;
}*LinkQueue;

void initQueue(LinkQueue* q) {//链队列初始化，见书p99图3.15a
    *q = (LinkNode*)malloc(sizeof(LinkNode));
    Node* p = (Node*)malloc(sizeof(Node));
    p->data = 0;
    p->next = NULL;
    (*q)->front = p;
    (*q)->rear = p;
}

bool EnterQueue(LinkQueue q, int n) {//队尾入队
    Node* p = (Node*)malloc(sizeof(Node));
    if (p == NULL)//申请失败
        return false;
    p->data = n;//存入数据
    q->rear->next = p;//入链
    q->rear = p;
    p->next = NULL;
    return true;
}

bool DeleteQueue(LinkQueue q, int* n) {//队头出列
    if (q->front->next == NULL)
        return false;
    Node* p = q->front->next;//注意此处q为指针域，q.front为头结点，真正的队列头应为q->front->next
    q->front->next = p->next;
    *n = p->data;
    free(p);
    return true;
}

void coutQueue(LinkQueue q) {//队列输出
    Node* p = q->front;
    cout << "Queue: ";//左侧队头，右侧队尾
    while (p->next != NULL) {
        p = p->next;
        cout << p->data << " ";
    }
    cout << endl;
}

int main() {
    LinkQueue q;
    initQueue(&q);
    for (int i = 0; i < 11; i++) {
        EnterQueue(q, i);
    }
    coutQueue(q);
    for (int i = 0; i < 5; i++) {
        int n = 0;
        DeleteQueue(q, &n);
        cout << "Delete: " << n;
    }
    cout << endl;
    coutQueue(q);
    return 0;
}