The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+3 votes
130 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) | 130 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 (35.1k points)
selected by
Thanks for link

welcome yes

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


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,834 questions
36,689 answers
90,626 comments
34,641 users