用C语言在链表中存储日期和时间

typedef struct DateTime {
    int year;
    int month;
    int day;
    int hour;
    int minute;
    int second;
} DateTime;

typedef struct Node {
    DateTime data;
    struct Node* next;
} Node;

#include <stdio.h>
#include <stdlib.h>

Node* createNode(DateTime data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

void insertNode(Node** head, DateTime data) {
    Node* newNode = createNode(data);
    if (*head == NULL) {
        *head = newNode;
    } else {
        Node* current = *head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = newNode;
    }
}

void deleteNode(Node** head, DateTime data) {
    if (*head == NULL) {
        return;
    }
    Node* current = *head;
    Node* previous = NULL;
    if (current->data.year == data.year &&
        current->data.month == data.month &&
        current->data.day == data.day &&
        current->data.hour == data.hour &&
        current->data.minute == data.minute &&
        current->data.second == data.second) {
        *head = current->next;
        free(current);
        return;
    }
    while (current != NULL &&
           (current->data.year != data.year ||
            current->data.month != data.month ||
            current->data.day != data.day ||
            current->data.hour != data.hour ||
            current->data.minute != data.minute ||
            current->data.second != data.second)) {
        previous = current;
        current = current->next;
    }
    if (current == NULL) {
        return;
    }
    previous->next = current->next;
    free(current);
}

void printList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        printf("%d-%02d-%02d %02d:%02d:%02d\n",
               current->data.year, current->data.month, current->data.day,
               current->data.hour, current->data.minute, current->data.second);
        current = current->next;
    }
}

void freeList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        Node* temp = current;
        current = current->next;
        free(temp);
    }
}

int main() {
    Node* head = NULL;

    DateTime dt1 = {2022, 1, 1, 0, 0, 0};
    DateTime dt2 = {2022, 1, 1, 12, 0, 0};
    DateTime dt3 = {2022, 1, 2, 0, 0, 0};

    insertNode(&head, dt1);
    insertNode(&head, dt2);
    insertNode(&head, dt3);

    printf("Inserted nodes:\n");
    printList(head);

    DateTime dt4 = {2022, 1, 1, 12, 0, 0};
    deleteNode(&head, dt4);

    printf("\nAfter deleting a node:\n");
    printList(head);

    freeList(head);

    return 0;
}