#### Reading material

Pages 341-350 (Section 8.3-8.3.4)
#### Additional material

Implementation of a dictionary by means of a hash table:
PostScript and
PDF
#### Question

Consider a dictionary implemented by means of a hash table.
Assume that the buckets are implemented by means of
binary search trees. What is the worst-case running time
of the operations findElement, insertItem and remove?