Visualizer library
Search 153 working visualizers across 14 data structures. Every result opens a real step-by-step workspace.
Showing 14 of 14 structures
An indexed sequence of elements with direct access by position (typically stored contiguously).
A linear collection of data elements where each element points to the next.
A linked data structure where each node contains references to both previous and next nodes.
A linked list variant where the last node points back to the head node, forming a circle.
A linear data structure that follows the LIFO (Last In, First Out) principle.
A linear data structure that follows the FIFO (First In, First Out) principle.
A hierarchical data structure consisting of nodes connected by edges.
A non-linear data structure consisting of nodes and edges connecting them.
A data structure that implements an associative array abstract data type.
A collection that contains no duplicate elements, backed by a hash table.
A two-dimensional array representing data in rows and columns.
A sequence of characters, often implemented as an array of characters.
Break down complex problems into overlapping subproblems with memoization and tabulation.
Systematic recursive exploration and state space pruning for combinatorial constraints.