Linked Lists

Pointers in motion: insertion, deletion, reversal, and cycle detection on every list variant.

4 visualizations

Compare

Reverse a Linked List

Reverses a singly linked list in place by flipping each node's next pointer using three pointers.

Beginnerlinked listpointers

Doubly Linked List

Demonstrates a doubly linked list's core operations: insert at head/tail and delete, with two-way prev/next pointers.

Beginnerlinked listdoubly linked

Merge Two Sorted Lists

Merges two sorted linked lists into one sorted list by repeatedly splicing the smaller head node.

Beginnerlinked listtwo pointers

Floyd's Cycle Detection

Detects a loop in a linked list with two pointers moving at different speeds, then finds the cycle's entry node.

Intermediatelinked listtwo pointers