Explore
101 visualisers you can step through forwards and backwards, with synced code and a reason for every move.
Showing 9 of 101
Pastel = track · chip = your mastery
- HierarchicalBinary Search TreeA binary tree where every left subtree holds smaller keys and every right subtree larger ones.O(log n)
- HierarchicalAVL TreeA self-balancing binary search tree that maintains height balance.O(log n)
- HierarchicalB-TreeA self-balancing tree data structure that maintains sorted data.O(log n)
- HierarchicalHeapA specialized tree-based data structure that satisfies the heap property.O(log n)
- HierarchicalUnion-FindDisjoint sets as a forest: union joins two trees, find walks to the root, and path compression flattens the way.O(α(n))
- HierarchicalTrie (Prefix Matching)A tree data structure used for efficient prefix matching.O(m)
- Hash-BasedHash TableA data structure that maps keys to values using a hash function.O(1)
- Hash-BasedBloom FilterA compact bit array that answers "definitely not in the set" or "probably in the set".O(k)
- Hash-BasedHash SetA data structure that stores unique elements using a hash function.O(1)