ELI5: linked list
// explanation
What is a linked list?
A linked list is like a chain of boxes where each box holds a piece of information and an arrow pointing to the next box [1]. Instead of storing things in a row in memory, the boxes can be anywhere, and they're connected by these arrows [1][2].
Why is it different from other ways to store information?
Normally when you store a list, everything has to sit in order next to each other, like books on a shelf [2]. But with a linked list, the items can be scattered all over, and you find them by following the arrows from one to the next [1].
What's the superpower of linked lists?
Linked lists are really good at adding new items or removing items because you don't have to rearrange everything else to make space [3]. With normal lists, if you want to insert something in the middle, you have to shift everything over [3].
When should you use a linked list?
You use linked lists when you're constantly adding and removing things from your collection, but you don't need to jump straight to item number 47 very often [1][3].
// sources
A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next.
Jul 6, 2025 ... A linked list is a list consisting of many separate little blocks of memory. Each block of memory contains a value, and a pointer to the nextย ...
Jan 26, 2026 ... A linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays.
Feb 21, 2018 ... Unsafe Rust isn't wrong Rust. Some things require unsafe, and that's (usually) OK. If in future, it becomes possible to write a doubly linked list in safe Rust.
Jan 8, 2020 ... A linked list is a page-fault generation machine, as it's extremely common for list nodes to be allocated in unrelated pages of memory, whereasย ...
Video by Bro Code

Video by Michael Sambol

Video by CS Dojo
