10.Hashtable

This section explains the concept, its importance, and when to use it.

10.Hashtable

ADT

Associative arrays / maps / dictionaries are abstract data types !!!

Supported operations:

HASH TABLES / DICTIONARIES

Time and space complexity analysis of the solution.

Balanced BST  we can achieve O(logN) time complexity for several operations including search

Distribute the keys uniformly into buckets

Collisions

Collision resolution with chaining: we put multiple entries into the same slot with the help of a linked list

Dynamic resizing

Use Cases: - Databases: sometimes search trees, sometimes hashing is better