Analysis of some parameters for random nodes in priority trees
Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers $1, dots, 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 o...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2008-04-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/546 |