Advanced Data Structures: Linked Lists

Define a self-referential struct for a linked list node.

Implement functions to insert a new node at the head, tail, or in a sorted position within a list.

Implement functions to search for and delete a node from a singly linked list.

Use a double pointer (char**) to write a function that modifies the head pointer of a list directly.

Traverse a linked list and safely deallocate all of its nodes.

Refactor the dynamic inventory from a dynamic array to a linked list, and justify the choice.