Linked lists trade random access for flexible rewiring. They appear in low-level systems where objects are constantly added, removed, or moved without shifting large contiguous blocks of memory.
Why it shows up
Choose it when O(1) splicing matters more than cache locality, especially in kernels, memory managers, and cache eviction logic.
Common domains
Process queues, timer lists, device lists, and wait queues
Kernel subsystems constantly splice tasks and devices in or out of internal lists while the machine is running. Linux-style intrusive lists are a classic example.
Why this structure fits
The kernel often already owns the node pointer, so removal or movement can happen without shifting memory.
Free lists for available memory blocks
Allocators maintain chains of free blocks and rewire them as memory is split, merged, allocated, and returned.
Why this structure fits
The allocator cares about fast structural updates more than direct indexing.
Hash map + doubly linked list
Many LRU cache designs use a hash map for lookup and a doubly linked list to move recently used items to the front and evict the oldest item from the tail.
Why this structure fits
The linked list gives constant-time reorder and eviction once the cache entry is found.
Editors, design tools, and browsing history
Doubly linked structures are a natural fit for stepping backward and forward through a sequence of user states.
Why this structure fits
Bidirectional traversal matters more than fast random access.
