A hash table (or hash map) is the data structure that implements a dictionary, storing key-value pairs with efficient O(1) average-case lookup, insertion, and deletion. The term 'hash' alone refers to the hashing function or technique, not the structure. Trees and linked lists are fundamental structures but don't provide dictionary-like key-value storage.