What are the techniques that you use to handle the collisions in hash tables?
- 1 Answers
- 1029 Views
- I also Faced
- E-Mail Answers
Answer Posted / Sudhakar Shukla
Hash table collisions can be handled using various techniques such as open addressing (linear probing, quadratic probing, double hashing) and chaining. In linear probing, when a collision occurs, the next available position is searched sequentially. Chaining involves creating a linked list for each hash bucket.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
