Hash Table Operations

O(log n) average; degraded by unbalanced trees O(1) average; degraded by hash collisions that cause many keys to map to the same bucket O(n) average; improved by adding more hash functions O(1) always; nothing can degrade performance