Reheapification
 | 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)
|
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
- ^ "Data Structures and Other Objects Using C++". www.cs.colorado.edu.
- ^ "Slides". www.buildingjavaprograms.com.
 |
{{IT-stub}