Visualize & Master
Algorithms & Data Structures
Explore classic & modern sorting algorithms, efficient searching techniques, and interactive data structure visualizations — all with real-time step-by-step animation, comparisons, swaps, and Big-O metrics.
Data Structure Visualizers
Explore fundamental data structures with interactive step-by-step visualization, real-time operation tracking, and detailed explanations.
Linked List
Insert, delete, search, reverse, and cycle detection with node-pointer visualization.
→ Abrir estúdioStack & Queue
Push, pop, peek, enqueue, dequeue operations with LIFO/FIFO visualization.
→ Abrir estúdioHash Table
Chaining and linear probing strategies with collision handling visualization.
→ Abrir estúdioBinary Tree
Inorder, preorder, postorder, and level-order traversals with tree visualization.
→ Abrir estúdioBinary Search Tree
Insert, search, delete, find min/max with BST property and pointer traversal.
→ Abrir estúdioHeap
Insert, extract max/min, build heap with array bar and tree overlay.
→ Abrir estúdioGraph Representation
Adjacency lists and matrices with directed/undirected and weighted variants.
→ Abrir estúdioGraph Traversal
BFS and DFS traversals with visited tracking, queue/stack snapshots, and order output.
→ Abrir estúdioShortest Path
Dijkstra and Bellman-Ford with distance tables, edge relaxation, and path reconstruction.
→ Abrir estúdioMinimum Spanning Tree
Prim's and Kruskal's algorithms with edge selection, union tracking, and MST cost.
→ Abrir estúdioUnion-Find (DSU)
Find, union by rank, and path compression with near-constant O(α(n)) operations.
→ Abrir estúdioSegment Tree
Build, range queries, and point updates with segment coverage visualization.
→ Abrir estúdioAVL Tree
Insert and search with balance-factor tracking and single/double rotations.
→ Abrir estúdioRed-Black Tree
Insert and search with red/black recoloring and rotation-based fix-ups.
→ Abrir estúdioTrie
Insert words, search, and prefix queries on a shared-prefix character tree.
→ Abrir estúdioB-Tree
Insert and search with node splitting on an order-4 multi-key tree.
→ Abrir estúdioFenwick Tree
Build, prefix sums, and range queries with the lowbit trick in O(log n).
→ Abrir estúdioSparse Table
Precompute power-of-two intervals for O(1) range minimum queries.
→ Abrir estúdioLCA
Lowest Common Ancestor queries with binary lifting on a rooted tree.
→ Abrir estúdioNetwork Flow
Edmonds-Karp max flow with augmenting paths and bottleneck highlighting.
→ Abrir estúdioA* Search
Optimal grid pathfinding with open/closed sets and the f = g + h heuristic.
→ Abrir estúdio