Category:Heaps (data structures)

From Infogalactic: the planetary knowledge core
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.

Pages in category "Heaps (data structures)"

The following 15 pages are in this category, out of 15 total.