4 problems

Let an STT be a search tree on a tree, and consider the strategy obtained by adapting Splay trees to the STT setting. Splay-tree competitiveness conjecture. The adapted Splay trees…

Let ${\mathcal{A}}$ be an online binary search tree algorithm. Starting with any initial tree $T$ with $n$ elements, let $X$ be the preorder sequence of a binary search tree $T'$ t…

Let ${\mathcal{A}}$ be an online binary search tree algorithm. Starting with any initial tree $T$ with $n$ elements, consider any sequence of $n$ splits. A split at an element $x$…

Let ${\mathcal{A}}$ be an online binary search tree algorithm. Starting with any initial tree $T$ with $n$ elements, consider inserting or deleting the current minimum or maximum e…