C语言数据结构

编写一个函数，传入一个双向循环链表，可以将整条链表正常销毁

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

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

// 初始化空的双向循环链表
Node* createList() {
    return NULL;
}

// 插入节点到双向循环链表
void insertNode(Node** head, int value) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = value;
    newNode->prev = NULL;
    newNode->next = *head;

    if (*head != NULL) {
        (*head)->prev = newNode;
    }

    *head = newNode;

    // 对于循环链表，需要将最后一个节点指向新插入的节点
    Node* temp = *head;
    while (temp->next != *head) {
        temp = temp->next;
    }
    temp->next = newNode;
    newNode->prev = temp;
}

// 打印双向循环链表
void printList(Node* head) {
    if (head == NULL) {
        puts("Empty list");
        return;
    }

    Node* temp = head;
    do {
        printf("%d -> ", temp->data);
        temp = temp->next;
    } while (temp != head);

    puts("");
}

// 销毁整个双向循环链表
void destroyList(Node** head) {
    if (*head == NULL) return; // 如果链表为空则直接返回

    Node* current = *head;
    while (current->next != *head) { // 遍历到倒数第二个节点
        Node* toDelete = current;
        current = current->next;
        free(toDelete);
        current->prev = NULL;
    }

    // 删除最后一个节点和头节点（此时它们是同一个节点）
    free(current);
    *head = NULL;
}

int main() {
    Node* head = createList();

    // 初始化链表
    insertNode(&head, 5);
    insertNode(&head, 2);
    insertNode(&head, 8);
    insertNode(&head, 3);
    insertNode(&head, 6);
    insertNode(&head, 9);

    printf("Original list: ");
    printList(head);

    // 销毁链表
    destroyList(&head);

    return 0;
}