Binary heap: Difference between revisions

Revision as of 09:42, 4 April 2024

Revision as of 10:42, 4 April 2024

Line 322:

==Related structures==

Since the ordering of siblings in a heap is not specified by the heap property, a single node's two children can be freely interchanged unless doing so violates the shape property (compare with [[treetreap]]). Note, however, that in the common array-based heap, simply swapping the children might also necessitate moving the children's sub-tree nodes to retain the heap property.

The binary heap is a special case of the [[d-ary heap]] in whicwhich d = 2.

==Summary of running times==