HASHING WITH SEPARATE CHAINS

2. [15 points] Hashing with Separate Chaining using Binary Search Trees Consider a hash table similar to separate chaining, but instead of defining the head of a linked list at each location, we have a link to the root of a binary search tree. [10 points] Show the result of inserting 44, 74, 33, 13, 2,63, 64, 36, 14, 53, 84, and 4, one at a time, into the hash table. Show the hash table with binary trees after each inserted item. Assume a hash table of size 10 with hash function x % 10. a. b. [4 points] Assuming an even distribution of N keys across M entries in the hash table, as in the course slides, what is the cost of a search in the worst case? In the average case