Skip to Main content Skip to Navigation
Journal articles

Analysis of some parameters for random nodes in priority trees

Abstract : Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers 1, . . . , n are equally likely to construct a priority tree of size n we study the following parameters in size-n trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972322
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:10:43 PM
Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:35:36 PM

File

546-3234-1-PB.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alois Panholzer. Analysis of some parameters for random nodes in priority trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, Vol. 10 no. 2 (2), pp.1--37. ⟨10.46298/dmtcs.447⟩. ⟨hal-00972322⟩

Share

Metrics

Record views

58

Files downloads

575