Step through real algorithms. Then build traces from your own solutions.
Pointers converge on the target by halving the search space each step.
Every data structure and feature available in the visual editor.
Linear data with indices, pointers, highlights, regions, and arrows.
Basic Array
Pointers
Pointers with Explicit Colors
Highlights (All 9 Colors)
Highlight Labels
Regions
Arrows
Combined Features
2D grids with cell highlights and directional arrows.
Basic Matrix
Cell Highlights with Labels
Matrix Arrows
Binary trees with node and edge highlighting.
Basic Binary Tree
Node Highlights
Edge Highlights
Singly and doubly linked lists with pointers, highlights, and cycle arrows.
Basic Singly Linked List
With Pointers (slow/fast)
Node Highlights with Labels
Arrows (Cycle Detection)
Doubly Linked List
Directed and undirected graphs with node and edge highlighting.
Directed Graph
Undirected Graph with Labels
Node and Edge Highlights
Custom Node Positions
Union Find
Key-value pairs with optional key highlighting.
Basic Entries
Key Highlights
LIFO stacks and FIFO queues with highlights.
Basic Stack
Stack with Highlights
Basic Queue
Queue with Highlights
Binary representations with highlighting and decimal values.
Basic Binary Display
Bit Highlights
Vertical bar charts for height-based problems like largest rectangle, trapping rain water, and container with most water.
Basic Histogram
Bar Highlights with Labels
Region Overlay (Largest Rectangle)
Pointers
Horizontal bars on a number line for interval scheduling, merge intervals, meeting rooms, and line sweep problems.
Basic Intervals
Labeled Intervals
Sweep Line
Event Markers
Manual Row Assignment
Recursion and backtracking call trees with status-colored nodes, edge labels, and return values.
All Node Statuses
Sign up to create interactive visualizations for any algorithm. Use our visual builder or generate traces from code with AI.
Get Started Free