Jump to content

Category:Heaps (data structures)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cydebot (talk | contribs) at 01:06, 17 January 2012 (Robot: Moved from Category:Heaps (structure). Authors: Ruud Koot, Alexbot, Mdd, Cydebot, Luckas-bot, BotMultichill, Adam Zivner, Wsloand). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Wikimedia Commons has media related to Heaps.

A heap is a tree data structure with ordered nodes where the min (or max) value is the root of the tree and all children are less than (or greater than) their parent nodes.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Heaps_(data_structures)&oldid=471785279"