𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On binary search trees

✍ Scribed by Roberto De Prisco; Alfredo De Santis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
378 KB
Volume
45
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Patterns in random binary search trees
Patterns in random binary search trees
✍ Philippe Flajolet; Xavier Gourdon; Conrado MartΓ­nez πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit

Weighted Binary Trees for Concurrent Sea
Weighted Binary Trees for Concurrent Searching
✍ David Cohen; Michael L. Fredman πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

Emerging behavior as binary search trees
Emerging behavior as binary search trees are symmetrically updated
✍ Stephen Taylor; Marianne Durand πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 267 KB

When repeated updates are made to a binary search tree, the expected search cost tends to improve, as observed by Knott. For the case in which the updates use an asymmetric deletion algorithm, the Knott e ect is swamped by the behavior discovered by Eppinger. The Knott e ect applies also to updates