DSA-VerseLearn by watching code run
DashboardData StructuresAlgorithmsVisualizerCORECoding PlaygroundInterview QuestionsComplexity AnalyzerLearning NotesBookmarksLearning ProgressSettings

Data Structures

Every interactive topic has a 16-part learning page: from what it is and how it sits in memory, to operations, code in four languages, complexity, common mistakes and practice.

Linear Data Structures

Arrays

Interactive

A fixed-size block of same-type elements stored next to each other in memory, accessed by index in O(1).

4 visualizer(s)

Dynamic Arrays

Planned

Arrays that grow by allocating a larger block (usually 2×) and copying — O(1) amortized append.

planned

Strings

Planned

Sequences of characters; often immutable, so building strings in loops needs care.

planned

Singly Linked Lists

Interactive

A chain of nodes where each node stores a value and a pointer to the next node.

1 visualizer(s)

Doubly Linked Lists

Planned

Nodes with both next and prev pointers — O(1) deletion given a node.

planned

Circular Linked Lists

Planned

The tail points back to the head; useful for round-robin scheduling.

planned

Stacks

Interactive

A Last-In-First-Out (LIFO) collection: push and pop happen only at the top.

1 visualizer(s)

Queues

Interactive

A First-In-First-Out (FIFO) collection: enqueue at the rear, dequeue from the front.

2 visualizer(s)

Circular Queues

Planned

Fixed-size ring buffer queues (see the Queue visualizer for a working version).

planned

Deques

Planned

Double-ended queues supporting O(1) insert/remove at both ends.

planned

Non-Linear Data Structures

Binary Trees

Interactive

A hierarchical structure where every node has at most two children: left and right.

1 visualizer(s)

Binary Search Trees

Planned

Left subtree < node < right subtree; inorder traversal yields sorted order.

planned

AVL Trees

Planned

Self-balancing BSTs that keep subtree heights within 1 using rotations.

planned

Red-Black Trees

Planned

Self-balancing BSTs with colour rules; used in many standard libraries.

planned

Heaps

Planned

Complete binary trees with the heap property; O(log n) push/pop for priority queues.

planned

Tries

Planned

Prefix trees storing strings character by character; fast prefix queries.

planned

Graphs

Interactive

Vertices connected by edges — the most general way to model relationships and networks.

2 visualizer(s)

Hash-Based Structures

Hash Tables

Planned

Arrays of buckets indexed by a hash function; O(1) average lookup.

planned

Hash Maps

Planned

Key → value dictionaries built on hash tables (Map, dict, HashMap, map).

planned

Hash Sets

Planned

Collections of unique keys with O(1) average membership tests.

planned

Collision Resolution

Planned

Strategies for two keys that hash to the same bucket.

planned

Chaining

Planned

Each bucket stores a list of entries that share the bucket.

planned

Open Addressing

Planned

Probe for another free slot (linear, quadratic, double hashing).

planned

Advanced Structures

Disjoint Set Union (Union Find)

Planned

Tracks connected components with near-O(1) union and find.

planned

Segment Trees

Planned

Range queries and point updates in O(log n).

planned

Fenwick Trees

Planned

Binary indexed trees for prefix sums with O(log n) updates.

planned

B-Trees

Planned

Balanced multi-way trees designed for disks and databases.

planned

B+ Trees

Planned

B-trees with all values in linked leaves; the index structure of most databases.

planned

Monotonic Stack

Planned

A stack kept increasing/decreasing to answer next-greater queries in O(n).

planned

Monotonic Queue

Planned

A deque kept monotonic for sliding-window maximum/minimum in O(n).

planned