Topological Self-similarity on the Random Binary-Tree Model
โ Scribed by Ken Yamamoto; Yoshihiro Yamazaki
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 430 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the