The distribution of keys in a binary heap

DOI10.1007/3-540-51542-9_42MaRDI QIDQ4028913zbMATH OpenFDO

Authors Mark Allen Weiss, Jainendra K. Navlakha

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_42

zbMATH Keywords

\(k\)th smallest elementheap

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A note on the height of the kth element in a heap
• An optimal algorithm for selection in a min-heap
• Heaps on Heaps
• Building heaps fast
• Expected heights in heaps

Cited in

(4)

• Expected heights in heaps
• A note on the height of the kth element in a heap
• An optimal algorithm for selection in a min-heap
• A nearly optimal randomized algorithm for explorable heap selection

This page was built for publication: The distribution of keys in a binary heap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028913)