Assuming uniform hashing and a constant load factor, what is the average-case time complexity of searching for an element in a hash table whose collisions are resolved by chaining?

O(1)

Under the Simple Uniform Hashing Assumption, the load factor remains constant, meaning each bucket in the table stores only a small, predictable number of elements on average. This allows for near-instantaneous retrieval regardless of the total data size, though it is important to remember that the worst-case complexity can still degrade to O(n) if all keys hash to the same bucket.