+1 vote
in Data Structures & Algorithms I by (110k points)
Is it true that splay trees have O(logn) amortized complexity ?

(a) true

(b) false

Enquiry is from Splay Tree topic in section Binary Trees of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct choice is (a) true

Best explanation: We go with amortized time complexity when we feel that not all operations are worst and some can be efficiently done. in splay trees not all splay operations will lead to O(logn) worst case complexity.

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.