Reheapification

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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.

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

[1] "Data Structures and Other Objects Using C++". www.cs.colorado.edu.

[2] "Slides". www.buildingjavaprograms.com.

[1]

[2]