1.60K viewsdata structure
0


What is the best definition of a collision in a hash table?(a) Two entries are identical except for their keys
(b) Two entries with different data have the exact same key
(c) Two entries with different keys have the same exact hash value.
(d) wo entries with the exact same key have different hash values.

Changed status to publish
9

Answer :
Explanation:
Answer(aThis level is the root of the tree.

Changed status to publish
error: Content is protected !!