(algorithm)

**Definition:**
An *algorithm* to insert a new *node* into a *shadow heap*. The new node is placed in the unordered table. When the table grows beyond some threshold size, table nodes and all their *parents* are reordered so everything is a heap.

**See also**
*shadow merge*.

*Note:
If the threshold size is O(log n), where n is the size of the heap, insertion is O(log log n), amortized. Personal communication from Chris L. Kuszmaul <fyodor@nas.nasa.gov>, January 1999.*

Author: CLK

Go to the Dictionary of Algorithms and Data Structures home page.

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 merge insert", 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/shadowmrgins.html