Data Structure Visualizers
Interactive browser tools for learning linked lists, trees, heaps, tries, graph traversal, matrix traversal, topological sort, shortest paths, sliding windows, two pointers, recursion trees, backtracking, dynamic programming, stacks, queues, hash tables, LRU cache, union find, and sorting algorithms. Paste real inputs, run operations, and inspect the structure step by step.
Binary Search Tree Visualizer
Visualize binary search tree operations online. Paste an insertion-order array, render the BST, and run search, delete, insert, and traversal steps.
Binary Search Visualizer
Visualize binary search online. Paste a sorted array, choose exact search or lower bound, and inspect low, high, mid, comparisons, and result index.
Prefix Sum Visualizer
Visualize prefix sum arrays online. Paste values, build cumulative sums step by step, choose a range, and inspect how range sum queries work.
Segment Tree Visualizer
Visualize segment tree range sum queries online. Build a tree from an array, inspect overlap decisions, and preview point updates.
Fenwick Tree Visualizer
Visualize Fenwick tree and Binary Indexed Tree range sums online. Build BIT slots, trace prefix jumps, and preview point updates.
Sparse Table Visualizer
Visualize sparse table range minimum and maximum queries online. Build power-of-two levels and inspect the two blocks used for RMQ.
Interval Tree Visualizer
Visualize interval tree overlap search online. Build an augmented BST, inspect subtree max values, and trace interval overlap queries.
Merge Intervals Visualizer
Visualize merge intervals online. Paste interval pairs, sort by start value, step through overlap checks, and inspect the merged output.
Monotonic Stack Visualizer
Visualize monotonic stack algorithms online. Paste an array, choose next greater or previous smaller mode, and step through stack pushes, pops, and results.
N-Queens Visualizer
Visualize the N-Queens backtracking algorithm online. Choose a board size, step through queen placements, rejected attacks, backtracking, and solutions.
Minimax Algorithm Visualizer
Visualize the minimax algorithm online with Tic-Tac-Toe. Edit a board, score legal moves, inspect game-tree search counts, and find the best move.
Binary Tree Visualizer
Visualize a binary tree from level-order input. Paste LeetCode-style values, render the tree, and run common traversal orders in your browser.
Heap Visualizer
Visualize min heap and max heap operations online. Paste an array, build a binary heap, insert values, extract the root, and inspect heap order.
AVL Tree Visualizer
Visualize AVL tree insertion, search paths, balance factors, and rotations. Paste values and see a self-balancing binary search tree online.
Trie Visualizer
Build and visualize a trie online. Paste words, search prefixes, autocomplete matches, and inspect how a prefix tree stores strings.
Graph BFS DFS Visualizer
Visualize graph BFS and DFS traversal online. Paste an edge list, choose a start node, and compare breadth-first and depth-first visit order.
Sorting Algorithm Visualizer
Visualize sorting algorithms online. Paste an array and step through bubble sort, insertion sort, selection sort, merge sort, or quick sort.
Linked List Visualizer
Visualize a singly linked list online. Paste values, render nodes and pointers, then insert, delete, search, and traverse the list.
Hash Table Visualizer
Visualize hash table and hash map operations online. Insert, search, delete, compare chaining with linear probing, and inspect collisions.
Stack and Queue Visualizer
Visualize stack and queue operations online. Paste values, push, pop, enqueue, dequeue, peek, and compare LIFO vs FIFO behavior.
Dijkstra Algorithm Visualizer
Visualize Dijkstra shortest path search online. Paste weighted graph edges, choose start and target nodes, and step through distance updates.
A Star Pathfinding Visualizer
Visualize A* pathfinding online. Paste a grid with walls, choose a heuristic, and step through open set, closed set, g, h, f, and final path.
Bellman Ford Visualizer
Visualize Bellman-Ford shortest paths online. Paste directed weighted edges, keep negative weights, and step through relaxation and cycle checks.
Floyd Warshall Visualizer
Visualize Floyd-Warshall all-pairs shortest paths online. Paste directed weighted edges and step through the distance matrix updates.
Kruskal Algorithm Visualizer
Visualize Kruskal MST construction online. Paste weighted edges, sort by weight, and step through union-find cycle checks.
Prim Algorithm Visualizer
Visualize Prim minimum spanning tree construction online. Paste weighted edges, choose a start node, and step through frontier edge choices.
KMP String Matching Visualizer
Visualize KMP string matching online. Enter text and pattern, build the LPS table, and step through comparisons, fallbacks, and match indexes.
Rabin Karp Visualizer
Visualize Rabin-Karp string matching online. Enter text and pattern, adjust base and modulus, then step through rolling hash checks.
Z Algorithm Visualizer
Visualize the Z Algorithm online. Enter text and pattern, build the combined string, inspect Z-box reuse, and find pattern match indexes.
Edit Distance Visualizer
Visualize edit distance online. Enter two strings, fill the Levenshtein DP table, and inspect insert, delete, substitute, and match decisions.
Longest Common Subsequence Visualizer
Visualize longest common subsequence dynamic programming online. Enter two strings, fill the LCS table, and backtrack one subsequence.
Coin Change DP Visualizer
Visualize coin change dynamic programming online. Enter coin values and a target amount, then step through minimum-coin DP updates.
Longest Increasing Subsequence Visualizer
Visualize longest increasing subsequence dynamic programming online. Paste numbers, compare prior indexes, and backtrack one LIS.
Fibonacci DP Visualizer
Visualize Fibonacci dynamic programming online. Choose n, fill the tabulation table, and inspect how each value reuses the previous two answers.
LRU Cache Visualizer
Visualize LRU cache operations online. Set capacity, run get and put operations, inspect the hash map, recency list, hits, misses, and evictions.
Union Find Visualizer
Visualize union find and disjoint set operations online. Create nodes, union sets, find roots, and inspect parent links, ranks, and connected components.
Topological Sort Visualizer
Visualize topological sorting online. Paste directed edges, run Kahn or DFS order, inspect in-degrees, queue updates, and cycle detection.
Recursion Tree Visualizer
Visualize recursion trees and call stacks online. Choose factorial, Fibonacci, or binary recursion and inspect calls, returns, depth, and stack frames.
Knapsack DP Visualizer
Visualize 0/1 knapsack dynamic programming online. Paste item weights and values, set capacity, inspect the DP table, and recover selected items.
Red Black Tree Visualizer
Visualize red black tree insertion online. Paste values, inspect node colors, rotations, recoloring, black height, and search paths.
Sliding Window Visualizer
Visualize sliding window algorithms online. Paste an array, run fixed-size or variable-size windows, and inspect left, right, sum, and best result.
Two Pointers Visualizer
Visualize two pointer algorithms online. Paste values, run sorted pair sum or container area, and inspect left and right pointer movement.
Backtracking Visualizer
Visualize backtracking online. Generate subsets or permutations, inspect the recursion stack, decision tree, current path, and completed results.
Matrix Traversal Visualizer
Visualize matrix traversal online. Paste a grid, run spiral order or grid BFS, and inspect visited cells, frontier cells, and traversal order.
Linear structures
Start with node chains, LIFO/FIFO access rules, direct lookup, cache eviction, and disjoint-set components before moving into trees and graphs.
Tree structures
Compare binary tree shape input, binary search tree ordering, AVL and red black balancing, interval overlap trees, segment and Fenwick tree ranges, heap priority rules, and trie prefix paths.
Traversal and shortest paths
Practice graph search, grid pathfinding, matrix traversal, dependency ordering, weighted shortest paths, minimum spanning trees, and array sorting with tools that show each state instead of only the final answer.
Algorithm patterns
Use array, range-query, string matching, recursion, and dynamic programming tools to connect pointer movement, windows, preprocessing, call stacks, branching subproblems, and table filling.
How to use this visualizer set
Start with a small input so the diagram is easy to read, then change one value at a time to see how the structure or algorithm reacts.
Compare related tools side by side. A stack, queue, linked list, hash table, LRU cache, union find, tree, and graph all expose different access patterns.
Use the highlighted traversal, shortest path, collision, swap, or step output to check your own code while practicing algorithm, array, graph, grid pathfinding, and recursion problems.