Revision as of 01:03, 12 February 2024 edit Hardyethan (talk \| contribs) 2 edits added another name of the down-heap operation ← Previous edit		Revision as of 09:42, 4 April 2024 edit undo 103.80.34.71 (talk) →Related structures Tag: Reverted Next edit →
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 [[~~treap~~tree]]). 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 ~~which d = 2.~~whic ==Summary of running times==

Binary heap: Difference between revisions