The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.
Answer would be 4) Search, Inseart and Delete
Here is a read, if you are interested.
welcome
4062 Points
2464 Points
1850 Points
1658 Points
1294 Points
1184 Points
1112 Points
1054 Points
900 Points
706 Points
Gatecse
hi, but according to this post
Nice Post.Thanks,