Schneider, Binary search trees: average and worst case behavior, Elektr. Informationsverarb Kybernetik 16 (1980), pp. 579{591.R. Gu¨ttler, K. Mehlhorn, W. Schneider, "Binary Search Trees: Average and Worst Case Behavior", Jour. of Information Processing and Cybernetics, 16, 41-61, 1980...
This construction consists in constructing a maximal descending or ascending segment and reversing the order in case of a descending one. If the constructed run is too short (that is, less than minRun) then it is extended to a run of length minRun using binary insertion sort (nRemaining is...
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 behavior. We show that the trees produced by the rules of thumb exhibit good worst ...
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 ) ...
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....