Language: EN FI

Exercises > Separate Chaining

These exercises demonstrate the content of the ByTheMark service. These are meant for private individuals for learning data structures and algorithms. If you want to try out more content, you can register to the ByTheMark Personal free of charge.

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

  Last modified Tue Mar 01 20:54:04 EET 2011