Dynamic Hashing Example

This is an example of extensible hashing. It covers a series of insertions, then deletions using these keys. The steps are chained together starting here, or you may use the index below.

Original Structure
After Inserting White
After Inserting Black
Prepared to Insert Brown
After Inserting Brown
After Inserting Archer
After Inserting Smart
Prepared to Insert Watkins
After Inserting Watkins
After Inserting Franks
After Deleting Smith
After Deleting Archer
After Deleting Carter
After Deleting Jones
After Reducing the Index