Category:Heaps (structure)

From Wikipedia, the free encyclopedia

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 (structure)"

The following 14 pages are in this category, out of 14 total. Updates to this list can occasionally be delayed for a few days.

*

2

A

B

B cont.

D

F

H

M

P

S

T
Languages