A note on the height of the \(k\)th element in a heap

DOI10.1007/BF01990524zbMath0799.68051OpenAlexW2029584875MaRDI QIDQ1314629

Patricio V. Poblete

Publication date: 27 March 1994

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01990524

zbMATH Keywords

digital search treesheapsexpected height

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Expected heights in heaps

This page was built for publication: A note on the height of the \(k\)th element in a heap