On the size of paged recursive trees
2017 ◽
Vol 09
(02)
◽
pp. 1750021
Keyword(s):
A paged recursive tree is constructed as a recursive tree except that it depends on an integer parameter [Formula: see text] representing a page capacity, small subtrees with size [Formula: see text]. We investigate the number of nodes [Formula: see text] (size of the tree) in paged recursive trees built from labels [Formula: see text]. The expectation and variance of [Formula: see text] are derived, and it is also shown that [Formula: see text] is asymptotically normal. [Formula: see text] as [Formula: see text] by applying the contraction method.
1991 ◽
Vol 5
(1)
◽
pp. 53-59
◽
2010 ◽
Vol DMTCS Proceedings vol. AM,...
(Proceedings)
◽
2011 ◽
Vol 48
(04)
◽
pp. 1189-1196
◽
2010 ◽
Vol 47
(01)
◽
pp. 191-200
◽
Keyword(s):
2013 ◽
Vol 50
(02)
◽
pp. 516-532
◽
Keyword(s):
Keyword(s):
Keyword(s):
2012 ◽
Vol 8
(2)
◽
pp. 67-72
Keyword(s):