Revision as of 11:23, 11 August 2002 edit B4hand (talk \| contribs) Extended confirmed users 1,492 edits Corrected my diagram and text ← Previous edit		Revision as of 11:25, 11 August 2002 edit undo B4hand (talk \| contribs) Extended confirmed users 1,492 edits m Added external link Next edit →
Line 24: So removing the largest node from a heap takes O(lg ''n'') steps. External Links: * http://mathworld.wolfram.com/Heap.html

Binary heap: Difference between revisions