An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

Prosenjit Bose, Karim Douïeb, Vida Dujmovic +1

We present the zipper tree, an $O(\log \log n)$-competitive online binary search tree that performs each access in $O(\log n)$ worst-case time. This shows that for binary search tr…