是否在C中删除链表中的元素？

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

// 定义链表节点结构
struct Node {
    int data;
    struct Node* next;
};

// 删除链表中的元素
void deleteElement(struct Node** head, int value) {
    struct Node* current = *head;
    struct Node* previous = NULL;

    // 遍历链表，找到需要删除的元素的前一个节点
    while (current != NULL && current->data != value) {
        previous = current;
        current = current->next;
    }

    // 如果找到了需要删除的元素
    if (current != NULL) {
        // 如果需要删除的元素是头节点
        if (previous == NULL) {
            *head = current->next;
        } else {
            previous->next = current->next;
        }
        // 释放需要删除的节点的内存空间
        free(current);
    }
}

// 打印链表
void printList(struct Node* head) {
    struct Node* current = head;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}

int main() {
    // 创建链表
    struct Node* head = (struct Node*)malloc(sizeof(struct Node));
    struct Node* second = (struct Node*)malloc(sizeof(struct Node));
    struct Node* third = (struct Node*)malloc(sizeof(struct Node));

    head->data = 1;
    head->next = second;

    second->data = 2;
    second->next = third;

    third->data = 3;
    third->next = NULL;

    printf("原始链表：");
    printList(head);

    // 删除元素2
    deleteElement(&head, 2);

    printf("删除元素2后的链表：");
    printList(head);

    // 释放链表内存空间
    free(head);
    free(second);
    free(third);

    return 0;
}