Jump to content

Reheapification

From Wikipedia, the free encyclopedia

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

[edit]
  1. ^ "Data Structures and Other Objects Using C++". www.cs.colorado.edu.
  2. ^ "Slides". www.buildingjavaprograms.com.