Linked list

A linear data structure whose elements store links to other elements instead of relying on consecutive memory locations. Its nodes can be rearranged by changing links without moving the stored values.

Singly linked list: A linked list whose nodes each point to the next node and usually have no backward link. Its one-way links are the simplest form of the structure.
Array (data structure): A data structure that stores elements in indexed positions, typically in contiguous memory. Arrays offer direct indexing, unlike sequential link-following.
LRU cache: A cache that evicts the item least recently used when it reaches capacity. A hash table and doubly linked list commonly support fast lookup and recency updates.
Abstract data type: A specification of data and permitted operations independent of their implementation. A list’s interface can be separated from its node-and-link implementation.
Cache locality: The tendency of programs to run faster when they access memory locations close together in time or space. Scattered nodes often use processor caches less effectively than contiguous arrays.
Doubly linked list: A linked list whose nodes point to both the next and previous nodes. Backward links enable traversal and removal from either direction.
Dynamic array: An array-backed structure that grows by allocating larger storage and copying elements when needed. It combines indexed access with resizing, competing with linked lists for dynamic sequences.
Round-robin scheduling: A scheduling method that assigns each task a fixed time slice in recurring order. A circular list naturally represents tasks that cycle repeatedly.
Time complexity: A measure of how an algorithm’s running time grows with input size. It captures the tradeoff between constant-time local edits and linear-time position access.
Amortized analysis: An analysis method that averages operation costs across a sequence of operations. It helps compare linked lists with resizable arrays whose occasional growth is expensive.

Linked from 4 pages