Data structures: trees · hashing · heaps

DATA STRUCTURES SIMULATION

▸ Generating a deterministic value sequence (seeded PRNG)…

▸ Building the binary search tree (insert · search · balance)

▸ Loading the hash table (hash function · collisions · chaining)

▸ Loading the min-heap (sift-up · sift-down)

▸ Hashing discrete steps for replay

▸ Ready — Online. ✅

Structure & cost

🌳 BST tree

Structure—

Nodes / keys—

Tree height—

Comparisons—

Load factor α—

Complexity—

Notes

A data structure is a way of organizing data in memory for efficient operations. For the same task of "finding a key", a BST tree (O(log n)), a hash table (O(1)) and an array (O(n)) cost very differently at scale.

—

Pick a ‘Scenario’ to change the structure (BST · degenerate · hash · collision · heap · cost compare) · 🔀 new data to rebuild · click a concept for details

Your browser has canvas disabled.

Items & cumulative comparisons over time itemscomparisons