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 Answers