Jump to content

Category:Heaps (data structures)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Luckas-bot (talk | contribs) at 07:42, 21 February 2011 (r2.7.1) (robot Adding: sk:Kategória:Haldy). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.