Jump to content

Reheapification

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cewbot (talk | contribs) at 23:10, 31 May 2020 (Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Underlinked). 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

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

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Reheapification&oldid=960062638"