Hashmap and its implementation. What is collision and what are collision resolution techniques
Answers
Answered by
0
HashMap handles the collision resolution by using the concept of chaining i.e., it stores the values in a linked list (or a balanced tree since Java8, depends on the number of entries). When multiple keys end up in same hash code which is present in same bucket.
Answered by
0
Answer:
mark me as brainliest and thank me if the answer is useful
Explanation:
Attachments:
Similar questions