GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
85 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.7k points)   | 85 views

1 Answer

+5 votes
Best answer

Answer would be 4) Search, Inseart and Delete

Here is a read, if you are interested. 

 

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

welcome yes

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


Top Users Jul 2017
  1. Bikram

    4062 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1850 Points

  4. joshi_nitish

    1658 Points

  5. Arjun

    1294 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1112 Points

  8. Shubhanshu

    1054 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    706 Points


24,022 questions
30,966 answers
70,346 comments
29,342 users