87+ interactive visualizations

Bornat Data Structure Visualizer

Learn, Visualize, Experiment, and Master Data Structures & Algorithms — with fully interactive, step-by-step animations built for real understanding.

Explore Algorithms Try the Playground
87+
Algorithms
13
Categories
12
Languages
5
Difficulty levels

Everything you need to master DSA

A modern, polished learning environment — not just animations, but a complete study tool.

Step-by-step execution

Play, pause, scrub, and step through every operation. Watch comparisons, swaps, and pointer moves unfold.

Code in 12 languages

Read idiomatic implementations in C, C++, Java, Python, Rust, Go, and more — with copy and download.

Editable & scalable

Build custom inputs, generate random data, and dial difficulty from Very Easy to Expert.

Learn deeply

Theory, complexity, applications, interview questions, and quizzes on every algorithm.

Playground

Draw your own graphs and arrays, then run any compatible algorithm on them instantly.

Accessible by design

Light, dark, and system themes with reduced-motion, high-contrast, and large-text options.

Explore by category

From sorting to string matching — thirteen rich topic areas.

Sorting

Watch arrays get ordered — comparisons, swaps, and partitions animated step by step.

Searching

Linear scans to logarithmic jumps — see exactly how each search narrows the field.

Linked Lists

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

Stacks & Queues

LIFO and FIFO structures with pushes, pops, and wrap-around circular buffers.

Hashing

Hash tables, collision strategies, and probabilistic filters — visualized bucket by bucket.

Trees

BSTs, AVL rotations, red-black recoloring, heaps, tries, and segment trees — live.

Graphs

Traversals, shortest paths, spanning trees, and connectivity on interactive graphs.

DP

Memoization tables and optimal substructure — watch subproblems fill in real time.

Greedy

Locally optimal choices building global solutions — scheduling, Huffman codes, and more.

Backtracking

Explore, fail, undo, retry — N-Queens, Sudoku, and maze solving with visible backtracks.

Recursion

Call stacks that grow and unwind before your eyes — Hanoi, factorial, and beyond.

Strings

Pattern matching from naive scans to KMP failure functions and rolling hashes.

Math

GCD, sieves, fast exponentiation — number theory with every intermediate value shown.

Ready to see algorithms come alive?

Pick a topic, hit play, and watch the theory turn into motion. No signup, no setup.

Start exploring Practice mode