使用链表实现的C语言入队

#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;
}

// 入队操作
void enqueue(Queue* queue, int data) {
    // 创建新节点
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;

    if (queue->rear == NULL) {
        // 队列为空，新节点既是队头又是队尾
        queue->front = newNode;
        queue->rear = newNode;
    } else {
        // 将新节点添加到队尾
        queue->rear->next = newNode;
        queue->rear = newNode;
    }
}

// 打印队列元素
void printQueue(Queue* queue) {
    Node* current = queue->front;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}

int main() {
    Queue queue;
    initQueue(&queue);

    // 入队操作
    enqueue(&queue, 1);
    enqueue(&queue, 2);
    enqueue(&queue, 3);

    // 打印队列元素
    printQueue(&queue);

    return 0;
}