On the Subtree Size Profile of Binary Search trees
2010 ◽
Vol 19
(4)
◽
pp. 561-578
◽
Keyword(s):
For random trees T generated by the binary search tree algorithm from uniformly distributed input we consider the subtree size profile, which maps k ∈ ℕ to the number of nodes in T that root a subtree of size k. Complementing earlier work by Devroye, by Feng, Mahmoud and Panholzer, and by Fuchs, we obtain results for the range of small k-values and the range of k-values proportional to the size n of T. In both cases emphasis is on the process view, i.e., the joint distributions for several k-values. We also show that the dynamics of the tree sequence lead to a qualitative difference between the asymptotic behaviour of the lower and the upper end of the profile.
Keyword(s):
2003 ◽
Vol 14
(03)
◽
pp. 465-490
◽
Keyword(s):
2016 ◽
Vol 26
(03)
◽
pp. 1650015
◽
Keyword(s):
Keyword(s):
1990 ◽
Vol 01
(04)
◽
pp. 449-463
◽
Keyword(s):
Keyword(s):
2010 ◽
Vol 19
(3)
◽
pp. 391-424
◽
2003 ◽
Vol 35
(2)
◽
pp. 363-376
◽
Keyword(s):
2000 ◽
Vol 11
(03)
◽
pp. 485-513
◽
Keyword(s):
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
Keyword(s):