Intro-CSharp-Book-v2015

714 Въведение в програмирането със C#
19
13 35
7 16
23
11 17
Предлагаме следния примерен код, който реализира описания алгоритъм:
///
/// Removes an element from the tree if exists
///
/// the value to be deleted
public void Remove(T value)
{
BinaryTreeNode nodeToDelete = Find(value);
if (nodeToDelete == null)
{
return;
}
}
Remove(nodeToDelete);
private void Remove(BinaryTreeNode node)
{
// Case 3: If the node has two children.
// Note that if we get here at the end
// the node will be with at most one child
if (node.leftChild != null && node.rightChild != null)
{
BinaryTreeNode replacement = node.rightChild;
while (replacement.leftChild != null)
{
replacement = replacement.leftChild;
}
node.value = replacement.value;