Data Structures

Data structures organize data for efficient access and modification. Explore how linked lists, stacks, queues, hash tables, trees, and heaps store data and support their core operations — every insert, delete, and lookup animated step by step.

23 results

Linked Lists

(4)

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

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

Merge Two Sorted Lists

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

Beginnerlinked listtwo pointers

Reverse a Linked List

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

Beginnerlinked listpointers

Stacks & Queues

(5)

Balanced Parentheses

Uses a stack to verify that every opening bracket has a correctly ordered matching closing bracket.

Beginnerstackmatching

Circular Queue (Ring Buffer)

A fixed-size queue whose front and rear indices wrap around with modulo arithmetic, reusing freed slots.

Intermediatequeuering buffer

Min-Stack (O(1) minimum)

A stack that also returns its minimum in O(1) by caching a running minimum with every pushed value.

Intermediatestackdesign

Queue (FIFO)

A first-in-first-out structure supporting enqueue at the rear and dequeue from the front in O(1).

BeginnerqueueFIFO

Stack (LIFO)

A last-in-first-out structure supporting push, pop, and peek — each in O(1).

BeginnerstackLIFO

Hashing

(4)

Hash Table — Double Hashing

Uses a second hash function as the step size, so different keys sharing a home slot follow completely different probe paths — no clustering.

Advancedhash tableopen addressing

Hash Table — Linear Probing

Resolves collisions by scanning forward one slot at a time until a free cell is found — simple and cache-friendly, but prone to clustering.

Intermediatehash tableopen addressing

Hash Table — Quadratic Probing

Resolves collisions with quadratically growing jumps (+1, +4, +9, …), breaking up the contiguous runs that plague linear probing.

Intermediatehash tableopen addressing

Hash Table — Separate Chaining

Resolves hash collisions by storing colliding keys in a per-bucket linked list.

Intermediatehash tablechaining

Trees & Heaps

(10)

Data Structures

Linked Lists

Doubly Linked List

Floyd's Cycle Detection

Merge Two Sorted Lists

Reverse a Linked List

Stacks & Queues

Balanced Parentheses

Circular Queue (Ring Buffer)

Min-Stack (O(1) minimum)

Queue (FIFO)

Stack (LIFO)

Hashing

Hash Table — Double Hashing

Hash Table — Linear Probing

Hash Table — Quadratic Probing

Hash Table — Separate Chaining

Trees & Heaps

AVL Tree (Self-Balancing BST)

B-Tree

Binary Search Tree

Binary Tree Traversals

Fenwick Tree (Binary Indexed Tree)

Level-Order Traversal (BFS)

Min-Heap (Binary Heap)

Red-Black Tree

Segment Tree (Range Queries)

Trie (Prefix Tree)