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.

• Type: Journal
• Year: 2004
• Where: CPC
• Authors: Kate Morris, Alois Panholzer, Helmut Prodinger
• Keywords: CPC 2004, Gaussian Limit Distribution, Plane Trees, Quasi Power Theorem