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

welcome yes

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


Top Users Sep 2017
  1. Habibkhan

    8796 Points

  2. rishu_darkshadow

    3572 Points

  3. Warrior

    2914 Points

  4. Arjun

    2840 Points

  5. A_i_$_h

    2550 Points

  6. manu00x

    2268 Points

  7. nikunj

    1990 Points

  8. Bikram

    1874 Points

  9. makhdoom ghaya

    1820 Points

  10. SiddharthMahapatra

    1718 Points


26,346 questions
33,927 answers
80,524 comments
31,231 users