Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 40
Open addressing vs separate chaining in hash tables: which is accurate?
A
Open addressing can't delete
B
They have identical memory layouts
C
Chaining never has collisions
D
Open addressing stores entries in the array itself (probing on collision) for better cache locality; chaining uses per-bucket lists and tolerates high load factors