Binary heap: Difference between revisions

Revision as of 00:35, 10 May 2004

Revision as of 11:36, 30 May 2004

Line 1:

[[de:Binärer Heap]][[pl:Kopiec (informatyka)]]

'''Binary heaps''' are a particular kind of [[heap]] such that each node only has two children. Binary heaps are commonly represented by [[array]]s of values. For example, the root of the tree could be item 0 in the array, and the children of item ''n'' are the items at 2''n''+1 and 2''n''+2; so item 0's children are items 1 and 2, 1's children are items 3 and 4, etc. This allows you to regard any 1-based array as a possibly-screwed-up heap.

Line 24 ⟶ 23:

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

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

[[Category:data structures]]

[[de:Binärer Heap]][[pl:Kopiec (informatyka)]]