2000 character limit reached
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
Published 27 Feb 2010 in cs.DS | (1003.0139v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.