Category:Heaps (data structures)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.