Separate chaining

Hide text Hide pseudo-code

Assume in the following hash table that we have pointers into the beginning as well as to the end of each linked list.

Use separate chaining to operate the hash table:

  • add - insert the given new key at the end of the linked list
  • remove - remove the key
  • search - search the key

  Created Fri Oct 30 13:52:50 EET 2009 - Powered by SVG-hut