Choosing a Linked List
Frequent insertion and deletion where node references are already available.
Workloads where contiguous memory allocation is undesirable or difficult.
Structures naturally represented through links between nodes.
Cases requiring stable node references under insertion or deletion, depending on the language and collection semantics.
Avoid linked lists when frequent random access is required.
Avoid them when memory locality and iteration performance are more important than cheap structural modification.