What is the bucket size, when the overlapping and collision occur at same time?
Answer Posted / rohit sah
One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.
Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How do you insert a new item in a binary search tree?
How do treesets work internally?
Explain what is a spanning tree?
Can we sort hashmap?
What are the average and worst time complexity in a sorted binary tree is
Is array static or dynamic?
Does treemap allow null key?
Can you sort a string?
What are the applications of graph data structure?
How would you use bsearch() function to search a name stored in array of pointers to string?
Describe what is Node in link list? And name the types of Linked Lists?
Is it possible to make an array volatile in java?
Write the recursive c function to count the number of nodes present in a binary tree.
Can arraylist shrink?
Can we remove element from arraylist while iterating?