data structures - Splay tree: worst-case sequence -

i want try trying executing worst-case sequence on splay tree.

but worst-case sequence on splay-trees? , there way calculate sequence given keys inserted tree?

any can me this?

unless corrects me, i'm going go "no 1 knows worst-case series of operations on splay tree or complexity in case."

while know many results efficiency of splay trees, don't know how bound time complexity of splay tree. there's conjecture called dynamic optimality conjecture says in worst case, sufficiently long series of operations on splay tree take no more constant amount of time more best possible self-adjusting binary search tree on series of operations. 1 of challenges we're having in trying prove no 1 knows how determine cost of best possible bst on inputs. finding upper bounds on runtimes of various input combinations splay trees hard - of now, no 1 knows whether takes time o(n) treat splay tree deque!

hope helps!