LECTURE 8 OF 25
Linked Lists
No indexing, no contiguous memory — just nodes pointing to the next one, which is exactly what makes O(1) insertion possible.
Builds on
Best read after 2. Arrays, 5. Recursion — you can still read ahead, but some of this may lean on ideas covered there.