Extensible Hashing Demo (Binary Keys)

• Input keys as binary strings like 1111, 0101, …
• Uses most significant bits (left-most) to index the directory.
• Bucket capacity is fixed at 3; on overflow it splits and (if needed) doubles the directory.
Note: If the key has fewer bits than the current global depth, the missing bits on the right are treated as 0s when choosing the directory slot.
Global depth:

Directory

Buckets

Log

No operations yet.