Vidyalelo
Data Structure · Q3

Hashing

Programming · Data Structure · question 3

Q3

Which of the following is a common method to handle collisions in hashing?

A.
Inorder traversal
B.
Depth-first search
C.
Linear probing
Answer
D.
Binary search

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board