Question: Which data structure is commonly used to handle collisions in hashing? i . Binary Search Tree ii . Linked List iii. Array iv . Heap
Which data structure is commonly used to handle collisions in hashing?
i Binary Search Tree
ii Linked List
iii. Array
iv Heap
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
