Objective

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

Steps

• Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
• Traverse the list from head to tail and call f(node->data) for every node you visit.
• If list is NULL, the function must return without touching anything.
• The callback is free to read or mutate the data it receives, your function only forwards the pointer.
• The prototype is void list_apply(ListNode *list, void (*f)(void *));.

Objective

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

Steps

• Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
• Traverse the list from head to tail and call f(node->data) for every node you visit.
• If list is NULL, the function must return without touching anything.
• The callback is free to read or mutate the data it receives, your function only forwards the pointer.
• The prototype is void list_apply(ListNode *list, void (*f)(void *));.