Assertion: tree's node | /r/HasProperty | deleted
Facets:
Source sentences:
text: If the left or right subtree of the node to be deleted is empty, the join operation is trivial; otherwise, the left or right child of the deleted node is selected as the new subtree root with probability proportional to its number of descendants, and the join proceeds recursively.
text: In a regular binary search tree when deleting a node with two non-leaf children, we find either the maximum element in its left subtree (which is the in-order predecessor) or the minimum element in its right subtree (which is the in-order successor) and move its value into the node being deleted (as shown here).
text: We use the label M to denote the node to be deleted; C will denote a selected child of M, which we will also call "its child".
text: Its value is copied into the node D being deleted.
text: The node to be deleted is first splayed, i.e. brought to the root of the tree and then deleted.