Add/Remove & Search in Hash Table (Implementation)

This lesson will cover the Pythonic implementation for search, insertion, and deletion in hash tables.

We'll cover the following

Resizing in a Hash Table
Insertion in Table
Search in a Hash Table
Deletion in Table

In the previous lesson, we built a HashTable class and designed a hash function. Using that code, we will implement the main functionalities of a hash table.

Resizing in a Hash Table

To start things off, we will make sure that the hash table doesn’t get loaded up beyond a certain threshold. Whenever it crosses the threshold, we shift the elements from the current table to a new table with double the capacity. This helps us avoid collisions.

To implement this, we will make the resize() function.

Have a look at resize() function in HashTable.py.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.

Introduction to Complexity Measures

Introduction to Lists

Introduction to Linked Lists

Introduction to Stacks and Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

Add/Remove & Search in Hash Table (Implementation)

Resizing in a Hash Table