-
If large number of items are stored in hash bucket, what happens to the internal structure?
-
- Any further addition throws Overflow exception
- The LinkedList will be replaced by another hashmap
- The bucket will increase its size by a factor of load size defined
- The bucket will switch from LinkedList to BalancedTree
- None of these
Correct Option: D
BalancedTree will improve performance from O(n) to O(log n) by reducing hash collisions.