Binary heap: Difference between revisions

Revision as of 19:40, 2 February 2005

Revision as of 20:56, 21 March 2005

Line 1:

[[Category:Trees (structure)]]

'''Binary heaps''' are a particularly simple kind of [[heap]] [[data structure]] created using a [[binary tree]]. It can be seen as a binary tree with two additional constraints:

Line 93 ⟶ 92:

* http://mathworld.wolfram.com/Heap.html

* http://www.policyalmanac.org/games/binaryHeaps.htm

[[Category:Trees (structure)]]

[[de:Binärer Heap]]

[[pl:Kopiec (informatyka)]]