Deleting the root of a heap

DOI10.1007/BF00264353zbMath0474.68051OpenAlexW2088987495MaRDI QIDQ1158958

Ernst-Erich Doberkat

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmsaverage behaviorinterchangesalgorithm for root deletionexpected number of comparisonsviable path in the tree representation

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (5)

ER modelling from first relational principles ⋮ The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) ⋮ Heaps with bits ⋮ BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) ⋮ A Survey on Priority Queues

This page was built for publication: Deleting the root of a heap