Revision as of 21:17, 7 September 2023 edit MrOllie (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 255,629 edits Reverted 1 edit by DGPickett (talk): Also unsourced Tags: Twinkle Undo ← Previous edit		Revision as of 20:07, 12 October 2023 edit undo InternetArchiveBot (talk \| contribs) Bots, Pending changes reviewers 5,689,793 edits Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 Next edit →
Line 253: \| publisher = Programming techniques and Data structures. Comm. ACM, 29(10): 996–1000 \| date = 1 October 1986 \| access-date = 29 April 2008 \| archive-date = 27 January 2007 \| archive-url = https://web.archive.org/web/20070127093845/http://cg.scs.carleton.ca/%7Emorin/teaching/5408/refs/minmax.pdf \| url-status = dead }}</ref> To do this, the rows alternate between min heap and max-heap. The algorithms are roughly the same, but, in each step, one must consider the alternating rows with alternating comparisons. The performance is roughly the same as a normal single direction heap. This idea can be generalized to a min-max-median heap.

Binary heap: Difference between revisions