Q250
What is the time complexity for the update cost on auxiliary trees?
A.
O (log (log n))
B.
k-1 O (log n)
C.
K2 O (log n)
D.
k+1 O (log (log n))
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board