Linked Lists
Follow the pointers — and learn every trick they hide.
Linked Lists progress0 / 10
- 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
- Find the Cycle StartKnowing a loop exists is half the job — now find its door.6m
- Merge Two Sorted ListsZip two ordered chains together without allocating a single node.5m
- Copy a List With Random LinksClone the nodes first, wire the pointers second.6m
- Doubly Linked ListsAdd a backwards pointer and removal stops needing a search.6m
Quiz yourself: 3 questions from this module
1 / 3