Practice Go: Hash Table Data Structure

A Hash table is a data structure that represents data in the form of key-value pairs. This data structure is able to add new key-value pair, get the value given the key, and delete a key-value pair. It has a property called Collision handling to handle hashing two values to the same slot. Collision handling has two types called open addressing and separate chaining(linked list).

The Hash table data structure is a very efficient data structure. In the best and average cases, the time complexity is constant. For more details, please read this link.

To impotent hash table, I will use Golang. People use a go Map and hash table Exchangeablly for the same thing. Here is the code for the data structure includes three operations: insert, search, and delete.