An O(log log 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(logn) 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.
- Publication:
-
Lecture Notes in Computer Science
- Pub Date:
- 2010
- DOI:
- 10.1007/978-3-642-13731-0_5
- arXiv:
- arXiv:1003.0139
- Bibcode:
- 2010LNCS.6139...38B
- Keywords:
-
- Computer Science - Data Structures and Algorithms
- E-Print:
- IMADA-preprint-cs