如何使用以下结构初始化双向链表？

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

struct Node* head = NULL;

struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));

newNode->data = 10;
newNode->prev = NULL;
newNode->next = NULL;

if (head == NULL) {
    // 如果链表为空，将头节点指向新节点
    head = newNode;
} else {
    // 如果链表不为空，将新节点的后一个指针指向头节点，将头节点的前一个指针指向新节点
    newNode->next = head;
    head->prev = newNode;
    // 将头节点指向新节点
    head = newNode;
}

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

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

int main() {
    struct Node* head = NULL;

    // 创建新节点
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = 10;
    newNode->prev = NULL;
    newNode->next = NULL;

    // 将新节点插入到链表的开头
    if (head == NULL) {
        head = newNode;
    } else {
        newNode->next = head;
        head->prev = newNode;
        head = newNode;
    }

    // 打印链表中的数据元素
    struct Node* current = head;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }

    return 0;
}