Each node holds a value and a pointer to the next node, so the list can grow anywhere without moving anything: inserting or removing is a matter of rewiring one or two pointers. The catch is that reaching position i means following i pointers.
- Typical operation
- O(n)
- Space
- O(n)