Content deleted Content added
Sam Hocevar (talk | contribs) m it's -> its |
Iron Wallaby (talk | contribs) m Removed stupid comment. |
||
Line 13:
8 9 10 11 1 2 3 4
Binary heaps are also 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 [[binary tree]] and hence, a
Retrieving the maximum/minimum element from a heap is the basis for the [[heapsort]] algorithm. Also note that the ordering of siblings in a heap is not specified by the [[heap|heap property]], so the two children of a parent can be interchanged.
| |||