If I notice that a hash table (or any other data structure built on a hash table) is filling up, at what point should you build a new table with more buckets. And given n items
If you use Linear Hashing, the table itself automatically takes care of resizing, by maintaining a constant load factor.