GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
54 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.3k points)   | 54 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 (25.3k points)  
selected by
Thanks for link

welcome yes

@rude what does it mean by amortized time complexity ? and how to get it.
Top Users Jan 2017
  1. Debashish Deka

    7906 Points

  2. Habibkhan

    4736 Points

  3. Vijay Thakur

    4474 Points

  4. sudsho

    4318 Points

  5. saurabh rai

    4200 Points

  6. Arjun

    3638 Points

  7. Bikram

    3500 Points

  8. santhoshdevulapally

    3480 Points

  9. GateSet

    3228 Points

  10. Sushant Gokhale

    3116 Points

Monthly Topper: Rs. 500 gift card

18,944 questions
23,897 answers
52,122 comments
20,213 users