在c中递归删除链表中的元素时的死循环

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

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

// 递归删除链表中的指定元素
void deleteElement(Node** head, int target) {
    if (*head == NULL) {
        return;  // 链表为空，直接返回
    }

    Node* current = *head;
    if (current->data == target) {
        *head = current->next;  // 删除头节点
        free(current);
        deleteElement(head, target);  // 递归删除剩余链表中的目标元素
    } else {
        deleteElement(&(current->next), target);  // 递归删除下一个节点
    }
}

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

int main() {
    // 创建链表
    Node* head = (Node*)malloc(sizeof(Node));
    head->data = 1;
    head->next = (Node*)malloc(sizeof(Node));
    head->next->data = 2;
    head->next->next = (Node*)malloc(sizeof(Node));
    head->next->next->data = 3;
    head->next->next->next = NULL;

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

    int target = 2;
    deleteElement(&head, target);

    printf("删除元素 %d 后的链表：", target);
    printList(head);

    // 释放链表内存
    Node* current = head;
    while (current != NULL) {
        Node* temp = current;
        current = current->next;
        free(temp);
    }

    return 0;
}