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

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

2010-02-27

arxiv.org/abs/1003.0139v1

Computer Science

Data Structures and Algorithms

IMADA-preprint-cs

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110814