(data structure)
Definition: A heap, implemented in an array, adjacent to an unordered table. The shadow is the table nodes and all their (recursive) parents, by array index, in the heap.
See also shadow merge insert, shadow merge.
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 Mon Feb 2 13:10:40 2015.
Cite this as:
Chris L. Kuszmaul, "shadow heap", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/shadowheap.html