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

Abstract

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 trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously.

IMADA-preprint-cs

References in corpus (1)

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

Cited by in corpus (1)

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