This is an old revision of this page, as edited by MarnetteD (talk | contribs) at 14:47, 15 June 2018 (prep for reFill fix). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
(Learn how and when to remove this message)
|
Reheapification is a term promoted by some C++ textbooks[1] to describe the process of fixing a binary search tree heap data structure, after a node is either removed or added. Other authors[2] refer to the process of bubble up or bubble down.
 | This article uses bare URLs, which are uninformative and vulnerable to link rot. Please consider converting them to full citations to ensure the article remains verifiable and maintains a consistent citation style. Several templates and tools are available to assist in formatting, such as reFill (documentation) and Citation bot (documentation). (June 2018) (Learn how and when to remove this message) |
 | This computing article is a stub. You can help Wikipedia by expanding it. |
