A note on constructing min-max heaps

DOI10.1007/BF01952680zbMath0677.68013OpenAlexW2060536709MaRDI QIDQ1123594

Thomas Strothotte, Sören Vallner, Patrik Eriksson

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

priority queuemin-max heaps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (1)

Multidimensional heaps and complementary range searching

Cites Work

• Unnamed Item
• Unnamed Item
• Average-case results on heapsort
• Bounds for min-max heaps
• On the random construction of heaps
• Heaps on Heaps
• Min-max heaps and generalized priority queues

This page was built for publication: A note on constructing min-max heaps