Lines Matching full:successor
150 * dict_next() successor function, verifying that the key of each node is
151 * strictly lower than that of its successor, if duplicates are not allowed,
670 * successor (i.e. the leftmost node in the right subtree.) By doing this,
671 * we avoid the traditional algorithm under which the successor's key and
672 * value *only* move to the deleted node and the successor is spliced out
674 * pointers to the successor, or nodes may be inextricably tied to some
690 * First, splice out the successor from the tree completely, by
705 * Now that the successor has been extricated from the tree, install it
887 * Return the given node's successor node---the node which has the
889 * no successor, a null pointer is returned rather than a pointer to
