HashMap Data Structure: How Elements Are Stored

D. Hash table

HashMaps utilize a hash table as their underlying data structure. This allows for fast key-value lookups and insertions. Hash tables use a hash function to map keys to unique indices within an array, enabling efficient access to elements.