Data Structures Toolkit

Hash Table Visualizer runs a real hash table with separate chaining — insert or look up a key and watch it hashed character by character, folded down onto a bucket index, and either slotted in cleanly or appended to a chain when it collides with something already there. It's the mechanism behind the "O(1) average" quoted for hash maps and sets throughout the Algorithms Toolkit, made concrete instead of taken on faith. Binary Search Tree Visualizer shows the ordered alternative — insert, search, and delete on a real BST, including the trickiest case in the whole data structure: deleting a node with two children by finding and promoting its in-order successor, traced step by step instead of skipped to the result. Heap Visualizer covers the structure behind priority queues — insert, extract, and peek on a real min-heap or max-heap, with every sift-up and sift-down comparison traced alongside the array it's actually built on. Trie Visualizer covers the structure behind autocomplete — insert, search, delete, and run a real prefix search, watching it collect every stored word under a prefix without ever touching a node outside that one subtree.