Repeat Programming Problem 9, but experiment with variations of chaining. For example, the hash table could point to binary search trees instead of chains of linked entries.
Programming Problem 9:
Repeat Programming Problem 7, but use the class Hashed Dictionary, as described in Section 18.4.6, which uses separate chaining to resolve collisions. Use the hash function h(x) = x mod table Size and the algorithm that involves Horner's rule, as described in Section 18.4.1about hash functions, to convert a variable into an integer x. Because you add an item to the dictionary only if its search key is not already present, does the time required for an insertion increase?
Programming Problem 7:
Implement the symbol table described in Exercise 5 by reusing the class Tree Dictionary , as described in Section 18.2.2 of this chapter.