Suppose these names have the following hash values.
Insert them into the extendible hash
table shown below. Each leaf can only hold 4 entries.
Note that the first two names
have already been inserted.
Illustrate each operation that occurs.
Bob 0100
Sue 1000
Tim 1110
Ron 0010
Ann 1010
Jan 1101
Ben 0001
Don 0101
Tom 1111
Sam 1011
---------------
| 0 | 1 |
---------------
/ ---------- ----------
| (1) | | (1) |
| Bob 0100 | | Sue 1000 |
| | | |
| | | |
| | | |
---------- ----------