Intro-CSharp-Book-v2015

Глава 17. Дървета и графи 715
}
node = replacement;
// Case 1 and 2: If the node has at most one child
BinaryTreeNode theChild = node.leftChild != null ?
node.leftChild : node.rightChild;
// If the element to be deleted has one child
if (theChild != null)
{
theChild.parent = node.parent;
// Handle the case when the element is the root
if (node.parent == null)
{
root = theChild;
}
else
{
// Replace the element with its child subtree
if (node.parent.leftChild == node)
{
node.parent.leftChild = theChild;
}
else
{
node.parent.rightChild = theChild;
}
}
}
else
{
// Handle the case when the element is the root
if (node.parent == null)
{
root = null;
}
else
{
// Remove the element - it is a leaf
if (node.parent.leftChild == node)
{
node.parent.leftChild = null;
}
else
{
node.parent.rightChild = null;
}
}