What does hashtable overhead mean?

I dont think a hashtable will have an overhead no matter how big it is since it uses the hash function to access entries?
@Design_Gurus could you please elaborate more on this point?


@Design_Gurus could you please respond to this?

All Hashtables have storage overhead. We need to store pointers/reference of objects while building a Hashtable. This gets quite complex using complicated chaining methods for avoiding collisions. Read/search “overhead” on this page: