Linked List
Domain: Data Structures
🎯 Motivation
When you need to insert or remove items frequently in the middle of a sequence, arrays are slow because everything must shift. Linked lists solve this.
📋 Concrete Example
Each node stores data and a pointer to the next node: A -> B -> C -> None. To insert X between A and B, just point A to X and X to B.
🔗 Analogy
A treasure hunt where each clue tells you where the next clue is hidden. You do not know all locations upfront, but following the chain leads you to the end.