C POOL — DAY 11

C's flagship data structure: a chain of nodes linked by addresses.

Unlike an array, a linked list can grow and shrink anywhere without copying everything. In exchange there is no more index: to reach the tenth element you have to walk through the first nine. This is the day pointers stop being an exercise and become a tool.

Full implementation of a singly linked list: creation, size, reversal, search, deletion, concatenation and function application over nodes.