Explore interactive visual demonstrations for binary search trees, heaps, hash tables with collision handling, graph BFS & DFS, Dijkstra's algorithm, sorting comparisons, and linear data structures with step-by-step state inspection.
🌲Binary Search Tree (BST) & Traversals
Intermediate State:Ready. Enter data or click an operation to step through execution.
🧪 Automated Algorithm Invariant Test Suite
Validates data structure invariants against known mathematical verification vectors.
