Why does insertion take O ( n ) time in hash table?

In the worst case scenario, all of the elements will have hashed to the same value, which means either the entire bucket list must be traversed or, in the case of open addressing, the entire table must be probed until an empty spot is found. Therefore, in the worst case, insertion takes O (n) time
For More Information Please Refer:


You May Also Like to Read: