数据结构队列的基本操作(链式结构)

#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
    int data;
    struct Node* next;
} Node;
typedef struct Queue {
    Node* front; 
    Node* rear; 
} Queue;
void initQueue(Queue* queue) {
    queue->front = NULL;
    queue->rear = NULL;
}
int isEmpty(Queue* queue) {
    return queue->front == NULL;
}
void clearQueue(Queue* queue) {
    Node* current = queue->front;
    while (current != NULL) {
        Node* temp = current;
        current = current->next;
        free(temp);
    }
    queue->front = NULL;
    queue->rear = NULL;
    printf("队列已清空\n");
}
void printQueue(Queue* queue) {
    if (isEmpty(queue)) {
        printf("队列为空\n");
        return;
    }
    Node* current = queue->front;
    printf("队列数据为: ");
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}
void enqueue(Queue* queue, int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;
    if (isEmpty(queue)) {
        queue->front = newNode;
        queue->rear = newNode;
    } else {
        queue->rear->next = newNode;
        queue->rear = newNode;
    }
    printf("数据 %d 入队列成功\n", data);
}
void dequeue(Queue* queue) {
    if (isEmpty(queue)) {
        printf("队列为空，无法出队列\n");
        return;
    }
    Node* temp = queue->front;
    int data = temp->data;
    queue->front = queue->front->next;
    free(temp);
    printf("数据 %d 出队列成功\n", data);
}

int main() {
    Queue queue;
    initQueue(&queue);
    int choice, data;
    
    do {
        printf("****************队列基本操作******************\n");
        printf("1. 队列清空\n");
        printf("2. 队列数据输出\n");
        printf("3. 数据入队列\n");
        printf("4. 数据出队列\n");
        printf("0. 退出系统\n");
        printf("请输入操作编号：");
        scanf("%d", &choice);
        
        switch (choice) {
            case 1:
                clearQueue(&queue);
                break;
            case 2:
                printQueue(&queue);
                break;
            case 3:
                printf("请输入要入队列的数据：");
                scanf("%d", &data);
                enqueue(&queue, data);
                break;
            case 4:
                dequeue(&queue);
                break;
            case 0:
                printf("退出系统\n");
                break;
            default:
                printf("无效的操作编号\n");
                break;
        }
        
        printf("\n");
    } while (choice != 0);
    
    return 0;
}