Jump to content

Reheapification

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LoudLizard (talk | contribs) at 17:42, 10 March 2016 (Add reflist). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

Relisted to generate a more thorough discussion and clearer consensus.
Please add new comments below this notice. Thanks, ~~~~
  1. ^ https://www.cs.colorado.edu/~main/javasupp/java10_files/frame.htm
  2. ^ http://www.buildingjavaprograms.com/slides/3ed/ch18-hashing-heaps.ppt
Retrieved from "https://en.wikipedia.org/w/index.php?title=Reheapification&oldid=709393116"