TheAlgorithms-C/leetcode/src/203.c

struct ListNode* removeElements(struct ListNode* head, int val){
    if (head == NULL)
        return NULL;
    if(head->val == val) {
        return removeElements(head->next, val);
    } else {
        head -> next = removeElements(head->next, val);
    }
    return head;
}