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

There are 13 pages in this section of this category.

*

2

A

B

B cont.

F

H

M

P

S

T
Retrieved from "http://en.wikipedia.org../../../h/e/a/Category%7EHeaps_%28structure%29_847c.html"