Reheapification

From HandWiki
Revision as of 07:04, 10 July 2021 by imported>WikiGary (fix)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

  1. ↑ "Data Structures and Other Objects Using C++". https://www.cs.colorado.edu/~main/javasupp/java10_files/frame.htm. 
  2. ↑ "Slides". http://www.buildingjavaprograms.com/slides/3ed/ch18-hashing-heaps.ppt. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Reheapification&oldid=83174"