Lines Matching full:replacement
179 * For node x, find its replacement upon removal.
182 * -- Otherwise, if node x has a left child, then the replacement is the
184 * -- Otherwise, the replacement is the leftmost right-descendent.
190 * Note that the replacement node, when found, is always a descendent
267 * The replacement node itself must be removed from its current in remove_node()
268 * place. By definition, that replacement node has either no in remove_node()
280 * Find replacement node 'y', and 'aly' is set to the address of in remove_node()
281 * the link to that replacement node. If the removed node has no in remove_node()
290 * The unlinked replacement node may have one child (but in remove_node()
300 * Link the replacement node in its new place, overwriting in remove_node()
306 * The replacement node adopts the left and right children in remove_node()
308 * the replacement node was a direct descendent of the in remove_node()
315 * No replacement, we simply unlink the node 'x'. in remove_node()