What is the time complexity of for achieving competitive ratio by tango tree?
(a) O (log n)
(b) O (n^2)
(c) O (n!)
(d) O (log (log n))
My question is based upon Binary Trees topic in section Binary Trees of Data Structures & Algorithms I
I had been asked this question in an internship interview.