Unformatted text preview: O ( u ) space. 2. How many entries are stored in the hash table of an x-fast tree in the worst case after adding n elements? In the lecture we gave a brief argument for n log u . However, this estimate was rough, since we overcounted the entries in the hash table. In particular, an entry in the hash table might be a preﬁx of diﬀerent “keys”, and we assume that every preﬁx is only stored once. Give a sharper bound for the number of elements stored in the hash table in terms of u and n . 1...
View Full Document
This note was uploaded on 01/20/2012 for the course CS 6.849 taught by Professor Erikdemaine during the Fall '10 term at MIT.
- Fall '10
- Data Structures