如何在C中查找双向链表中的名称和删除节点？

typedef struct Node {
    char name[50];
    struct Node* prev;
    struct Node* next;
} Node;

Node* head = NULL;
Node* tail = NULL;

void insertNode(char name[]) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    strcpy(newNode->name, name);
    newNode->prev = NULL;
    newNode->next = NULL;

    if (head == NULL) {
        head = newNode;
        tail = newNode;
    } else {
        tail->next = newNode;
        newNode->prev = tail;
        tail = newNode;
    }
}

Node* findNode(char name[]) {
    Node* current = head;
    while (current != NULL) {
        if (strcmp(current->name, name) == 0) {
            return current;
        }
        current = current->next;
    }
    return NULL;
}

void deleteNode(char name[]) {
    Node* nodeToDelete = findNode(name);
    if (nodeToDelete == NULL) {
        printf("Node not found.\n");
        return;
    }

    if (nodeToDelete == head) {
        head = nodeToDelete->next;
    } else {
        nodeToDelete->prev->next = nodeToDelete->next;
    }

    if (nodeToDelete == tail) {
        tail = nodeToDelete->prev;
    } else {
        nodeToDelete->next->prev = nodeToDelete->prev;
    }

    free(nodeToDelete);
}