Skip to content

DSA Visualizer · Data structures & algorithms

Watch algorithms think.

Step through every comparison, swap, split and rotation — with the code that does it.

Start with sortingAll visualizers

Take the tour

best with sound on
An 83-second tour of the DSA Visualizer: the three-pane workspace, merge sort, a sorting race, linked lists, infix to postfix, building a heap, an AVL rotation, a B-tree split, Dijkstra and three more graph algorithms side by side, and the playback controls and code tabs.

Visualizers

8 topics
Algorithms

Sorting Algorithms

Merge sort's split tree, quick sort's partitions, and six more.

Linear

Stack & Queue

LIFO, FIFO, ring buffers — and the stack behind every parser.

Linear

Linked List

Every pointer rewired, in the order it happens.

Trees

Binary Heap

One array, one tree, and the swaps that keep them in order.

Trees

Binary Search Tree

Smaller left, larger right — searches, deletes and traversals.

Trees

AVL Tree

Watch a tree rebalance itself, one rotation at a time.

Trees

B-Tree

The tree behind databases: splits, merges and borrows.

Graphs

Graph Algorithms

Draw a graph and run BFS, Dijkstra, MSTs and more on it.

Every algorithm, one click away

Sorting Algorithms

Stack & Queue

Linked List

Binary Heap

Binary Search Tree

AVL Tree

B-Tree

Graph Algorithms

Questions

What is a DSA visualizer?

A DSA visualizer animates data structures and algorithms one step at a time, so you can see every comparison, swap, pointer change or rotation instead of imagining it. This one also highlights the matching line of code and explains why each step happens.

Which algorithms and data structures can I visualize?

Eight sorting algorithms (bubble, selection, insertion, shell, counting, radix, merge, quick), stacks, queues, circular queues, deques, linked lists, binary heaps and heap sort, binary search trees, AVL trees, B-trees, and graph algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Kruskal, Prim, topological sort and strongly connected components.

Can I use my own input?

Yes. Every visualizer accepts your own values (whole numbers from 0 to 999), offers presets and random data, and you can build your own graph by clicking. Leave the box empty and it picks a random value for you.

Does it show real code?

Yes. Each page shows pseudocode that highlights the line being executed, plus tested implementations in Python, C++, Java and JavaScript that you can copy.

Is it free?

Yes — it is free, needs no sign-up, and runs entirely in your browser.

Can AI agents use this site?

Yes. Pages expose WebMCP tools so browser agents can run visualizations directly, and a Markdown copy of every explanation is listed in /llms.txt.