We introduce several rules of thumb for constructing nearly optimal binary search trees and survey results about the average search time of the trees yielded. Then we introduce a new point of view: worst case b
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....
Given a file of N records each of which has k keys, the worst-case analysis for the region and partial region queries in multidimensional binary search trees and balanced quad trees are presented. It is shown that the search algorithms proposed in [1, 3] run in time O(k·N 11/k ) ...