๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Height balance distribution of search trees

โœ Scribed by Ricardo A. Baeza-Yates

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
786 KB
Volume
39
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the distribution of binary search tre
On the distribution of binary search trees under the random permutation model
โœ James Allen Fill ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar

Minimal trees of given search number
Minimal trees of given search number
โœ Jonathan D.H. Smith ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 717 KB

A recurrence relation and asymptotic estimate for the number of minimal trees of given search number are derived. In addition, a language for describing these trees and structures within them is developed. Their automorphisms groups are also discussed.

A comparison of minimax tree search algo
A comparison of minimax tree search algorithms
โœ Murray S. Campbell; T.A. Marsland ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is