Sciweavers

Share
CPC
2004

On Some Parameters in Heap Ordered Trees

9 years 5 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes are selected at random: the size of the ancestor tree of these nodes and the smallest subtree generated by these nodes. We compute expectation, variance, and also the Gaussian limit distribution, the latter as an application of Hwang's quasi power theorem.
Kate Morris, Alois Panholzer, Helmut Prodinger
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CPC
Authors Kate Morris, Alois Panholzer, Helmut Prodinger
Comments (0)
books