It's not technically. Worst-case guarantee is required for some applications. Hash Maps have better amortized complexity but some implementations have bad worst case time.
Java uses balanced trees instead of linked list in their chained-hashtable implementation, if I recall correctly.
Java uses balanced trees instead of linked list in their chained-hashtable implementation, if I recall correctly.