+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

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

The explanation is: Tango tree is an online binary search tree whose time complexity is O (log (log n)) when compared to the time complexity of offline binary search tree model. Online algorithm processes input or data provided piece by piece.

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.

Categories

...