3.10.1: Double hashing. X3/07 Jump to level 1 vals Table: 0 11 Empty since start 1 Empty-after-removal 2 Occupied 3 on w

[answerhappygod]

3 10 1 Double Hashing X3 07 Jump To Level 1 Vals Table 0 11 Empty Since Start 1 Empty After Removal 2 Occupied 3 On W 1 (45.32 KiB) Viewed 34 times

3.10.1: Double hashing. X3/07 Jump to level 1 vals Table: 0 11 Empty since start 1 Empty-after-removal 2 Occupied 3 on w N 4 5 Hash table valsTable uses double probing with the hash functions hash1(key): key % 11 hash2(key): 7 - key % 7 and a table size of 11. 6 50 7 Hashinsert(vals Table, item 41) inserts item 41 into bucket Ex: 10 8 9 Hashinsert(valsTable, item 72) inserts item 72 into bucket 10 HashInsert(valsTable, item 33) inserts item 33 into bucket