Revision as of 05:13, 20 May 2025 edit NaomiAmethyst (talk \| contribs) Edit filter managers, Autopatrolled, Administrators 6,877 edits m →Decrease or increase key: add section link note ← Previous edit		Revision as of 04:25, 27 May 2025 edit undo Vince Vatter (talk \| contribs) Extended confirmed users 704 edits m wikified Michael D. Atkinson Next edit →
Line 251: It is possible to modify the heap structure to make the extraction of both the smallest and largest element possible in [[Big O notation\|<math>O</math>]]<math>(\log n)</math> time.<ref name="sym">{{cite web \| url = http://cg.scs.carleton.ca/~morin/teaching/5408/refs/minmax.pdf \| ~~author~~author1 = Atkinson, M.D. \| author1-link = Michael D. Atkinson \| author2 = J.-R. Sack \| author2-link = Jörg-Rüdiger Sack

Binary heap: Difference between revisions