If I use a balanced tree instead of lists in a hash table implementation, and also after initializing my table I don't enlarge nor reduce the size of the table, what would be the worst case complexity?
Complexity of a hash tables with balanced trees in the buckets
time complexity;hash;hash tables
If you take a table of size 1 (the smallest possible case), what is the complexity?If you take a table of size 42, what is the complexity?If you take a table of size 2013, what is the complexity?If you take a table of size $n$, what is the complexity? It's always the complexity of the balanced tree. Times a constant, which doesn't change the big oh.