[ad_1]
If we use an array of linked list to implement hash table, “add” could be implemented in a way that no traversing is needed. Is this true or false?
[ad_2]
solved If we use an array of linked list to implement hash table, “add” could be implemented in a way that no traversing is needed. Is this true or false?