Data structures
Hash Table
hash table — linear probing
size: 7keys: 0λ: 0.00
rehash @ λ=0.7
0→
empty
1→
empty
2→
empty
3→
empty
4→
empty
5→
empty
6→
empty
occupied
probing
found
not found
inserted
deleted / tombstone
rehashing
→hash target
Select an operation to begin