Linked List

Definitions

1. A linear data structure where each element (node) contains a value and a pointer to the next node, allowing O(1) insertion and deletion at known positions but requiring O(n) traversal for random access. Variants include singly linked, doubly linked, and circular linked lists.

   In plain English: A chain of data where each piece points to the next one, making it easy to add or remove items but slow to jump to a specific position.

   Example: "We use a doubly linked list for the LRU cache so we can move accessed entries to the head in constant time."

Related Terms

• Heap
• Hash Map
• Hash Ring
• Hash Set
• Hashing Algorithm
• Knuth
• LIFO
• Pass by Reference
• Pass by Value
• Priority Queue
• Random Access
• Reference
• Round Robin
• Search Algorithm
• Search Tree
• Shallow Copy
• Slice
• Sorted Set
• Tree
• Weak Map
• Weak Set
• Balanced Tree
• Binary Search Tree
• Bit Field
• BST
• Bucket Sort
• Circular Buffer
• Concurrent Map
• Concurrent Queue
• Concurrent Set
• Connected Component
• Cyclic Reference