Jump to content

Reheapification

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Josve05a (talk | contribs) at 01:36, 12 June 2018 (cleanup, added orphan tag using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (June 2018)

This article needs more links to other articles to help integrate it into the encyclopedia. Please help improve this article by adding links that are relevant to the context within the existing text. (May 2016) (Learn how and when to remove this message)

(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.

References

This computing article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Reheapification&oldid=845476271"

Hidden categories: