Skip to main content Accessibility help
×
Home

On Some Parameters in Heap Ordered Trees

  • KATE MORRIS (a1), ALOIS PANHOLZER (a2) and HELMUT PRODINGER (a1)

Abstract

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.

Copyright

On Some Parameters in Heap Ordered Trees

  • KATE MORRIS (a1), ALOIS PANHOLZER (a2) and HELMUT PRODINGER (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed