1.

What is the time complexity of the delete function in the hash table using a binary tree?

A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Answer» B. O(n)


Discussion

No Comment Found