Question: Suggest how storage for elements can be allocated

Suggest how storage for elements can be allocated and deal located within the hash table itself by linking all unused slots into a free list. Assume that one slot can store a flag and either one element plus a pointer or two pointers. All dictionary and free-list operations should run in O (1) expected time. Does the free list need to be doubly linked, or does a singly linked free list suffice?

View Solution:


Sale on SolutionInn
Sales1
Views283
Comments
  • CreatedJuly 12, 2010
  • Files Included
Post your question
5000