GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
60 views

The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.

  1. Search
  2. Search and Insert 
  3. Search and Delete
  4. Search, insert and delete
asked in DS by Active (1.4k points)   | 60 views

1 Answer

+4 votes
Best answer

Answer would be 4) Search, Inseart and Delete

Here is a read, if you are interested. 

 

answered by Veteran (29.4k points)  
selected by
Thanks for link

welcome yes

@rude what does it mean by amortized time complexity ? and how to get it.


Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2092 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1318 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    1004 Points

Monthly Topper: Rs. 500 gift card

21,439 questions
26,753 answers
60,919 comments
22,929 users