(algorithm)
Definition: An algorithm to merge two heaps by concatenating the smaller heap to the larger, then reordering just the concatenated nodes and their parents to restore the heap property.
See also shadow heap.
Note: Personal communication from Chris L. Kuszmaul <fyodor@nas.nasa.gov>, January 1999.
Author: CLK
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Chris L. Kuszmaul, "shadow merge", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/shadowmerge.html