Solutions to other chapters:
Java Methods A & AB:
|
3. |
|
6. | (a) | F -- it is O(1) |
(d) | T -- for a reasonably functioning hash table; also, after several removals and additions, a BST may need rebalancing. |
7. | (b) | A hashTable element takes 4 bytes,
ListNode takes 8 bytes;
Record takes 20 bytes. With 5 nodes per slot
(on average) we need
Finding a record in a hash table takes one
|
Copyright © 2006 by Skylight Publishing