educative.io

About the Introduction to Hashing - Add/Remove & Search in Hash Table (Implementation) category


#1

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

View the lesson here.


#2

Hi,

The lesson states that hash table search function runs in constant time O(1).

Why is it not O(n) time since the search function has to traverse a linked list at the given bucket[index] until it finds the key it is looking for?

Thanks