4 votes 4 votes The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$. Search Search and Insert Search and Delete Search, insert and delete DS tree + – shivani2010 asked Jun 9, 2016 shivani2010 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply sohelcse commented Oct 21, 2020 reply Follow Share search , insert ,delete 0 votes 0 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes Answer would be 4) Search, Inseart and Delete Here is a read, if you are interested. rude answered Jun 9, 2016 • selected Jun 9, 2016 by shivani2010 rude comment Share Follow See all 4 Comments See all 4 4 Comments reply shivani2010 commented Jun 9, 2016 reply Follow Share Thanks for link 1 votes 1 votes rude commented Jun 9, 2016 reply Follow Share welcome 0 votes 0 votes himanich commented Jul 16, 2016 reply Follow Share @rude what does it mean by amortized time complexity ? and how to get it. 1 votes 1 votes smsubham commented Feb 13, 2018 reply Follow Share @ himanich Refer this: https://www.geeksforgeeks.org/analysis-algorithm-set-5-amortized-analysis-introduction/ 0 votes 0 votes Please log in or register to add a comment.