Linked Lists
Follow the pointers — and learn every trick they hide.
Linked Lists progress0 / 6
- Singly Linked List BasicsEach item carries the address of the next one.4m
- Traversal and SearchOne node at a time is the only way through.4m
- Insert and DeleteRewire two links, and nothing else has to move.5m
- Reverse a Linked ListFlip every arrow backwards using three pointers.5m
- Fast and Slow PointersOne hop versus two finds the middle in one pass.5m
- Detect a CycleIf the list loops, the fast pointer laps the slow one.5m