+1 vote
in Data Structures & Algorithms I by (110k points)
What is the time complexity for the update cost on auxiliary trees?

(a) O (log (log n))

(b) k-1 O (log n)

(c) K^2 O (log n)

(d) k+1 O (log (log n))

This interesting question is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

This question was posed to me by my school principal while I was bunking the class.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
The correct option is (d) k+1 O (log (log n))

The explanation is: The update cost also is bounded by the upper bound. We perform one cut as well as one join operation for the auxiliary tree, so the total update cost for the auxiliary tree is found to be k+1 O (log (log n)).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.