Empty list — head → null. Insert a value.
AlgoPlus//structures / linked-list
Read the theory

Linked List

Nodes chained by pointers — cheap inserts, linear traversal.

Length
4
Head
4
Legend
Pointer / scanning
Found / inserted
Node
AI Tutor Workspace
In a nutshell
A linked list stores each value in its own little box — a node — that also holds a pointer to the next node, chaining them together. Because the boxes aren't packed side by side like an array, adding one at the front is instant: you just repoint a link. The trade-off is that there's no jumping to the 10th item — you have to follow the pointers from the head and walk the chain one node at a time.
Ready
Press play to begin the cinematic walkthrough.
Unlike an array, a linked list stores each value in its own node that points to the next — so inserting at the head is O(1), but finding the k-th element means walking the chain.
Key terms
Go deeper in the lesson
Read the full theory, intuition & complexity for Linked List.