Asymptotic distribution of two-protected nodes in random binary search trees
โ Scribed by Hosam M. Mahmoud; Mark Daniel Ward
- Book ID
- 116217655
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 214 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
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
Let T n denote the set of unrooted unlabeled trees of size n and let k โฅ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value โผ ยต k n and variance โผ ฯ 2 k n with positive constants ยต
Multidimensional binary trees represent a symbiosis of trees and tries, and they essentially arise in the construction of search trees for multidimensional keys. The set of nodes in a d-dimensional binary tree can be partitioned into layers according to the nodes appearing in the ith dimension. We d