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 | 130 views

Answer would be 4) Search, Inseart and Delete

Here is a read, if you are interested.

selected

welcome

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