Q111
What is the worst case time complexity of the insertion in the hash tree?
A.
O(logk(n))
AnswerB.
O(n2)
C.
O(nlogk(n))
D.
O(kn)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board