a) The bucket will switch from LinkedList to BalancedTree
b) The bucket will increase its size by a factor of load size defined
c) The LinkedList will be replaced by another hashmap
d) Any further addition throws Overflow exception
Meghna MittalBegginer
a
Explanation: BalancedTree will improve performance from O(n) to O(log n) by reducing hash collisions.