Linked Lists

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

6 visualizations

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

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

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

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

Performs front/back insertion, search, and deletion with explicit pointer rewiring.

Maintains a singly linked cycle where the tail always links back to the head.