What is the time complexity of insert function in a hash table using a binary tree?
(c) O(log n)
(d) O(n log n)
My question comes from Hash Tables in division Hash Tables of Data Structures & Algorithms I
I had been asked this question in homework.