On the random construction of heaps (Q1108784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the random construction of heaps |
scientific article; zbMATH DE number 4068256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the random construction of heaps |
scientific article; zbMATH DE number 4068256 |
Statements
On the random construction of heaps (English)
0 references
1988
0 references
We give a simple proof of the result of \textit{B. Bollobás} and \textit{I. Simon} [J. Algorithms 6, 466-477 (1985; Zbl 0592.68022)] on the linear expected time construction of a binary heap. We also give bounds on the probability that the construction time is much more than this and generalize the result to d-heaps, \(d\geq 2\).
0 references
upper bound
0 references
binary heap
0 references
d-heaps
0 references
