• A linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. A linked list is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing more efficient insertion or removal of nodes at arbitrary positions. A drawback of linked lists is that access time is linear. Faster access, such as random access, is not feasible. Arrays have better cache locality compared to linked lists. Linked lists were developed in 1955/1956. ← Wikipedia

1. Previous term: Linked Data
2. Next term: Linter
3. Random term: Tokenization