Jump to content

Reheapification

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Wiverson (talk | contribs) at 17:11, 10 March 2016 (←Created page with 'Reheapification is a term promoted by some C++ textbooks to describe the process of fixing a binary search tree heap data structure, after a node is either remov...'). 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)

Reheapification is a term promoted by some C++ textbooks to describe the process of fixing a binary search tree heap data structure, after a node is either removed or added. Other books refer to the process of bubble up or bubble down.^[1]

^ https://www.cs.colorado.edu/~main/javasupp/java10_files/frame.htm

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