Intro-CSharp-Book-v2015

Глава 17. Дървета и графи 701
if (value.hasParent)
{
throw new ArgumentException(
"The node already has a parent!");
}
}
}
}
value.hasParent = true;
this.rightChild = value;
///
/// Represents a binary tree structure
///
/// the type of the values in the
/// tree
public class BinaryTree
{
// The root of the tree
private BinaryTreeNode root;
///
/// Constructs the tree
///
/// the value of the root node
/// the left child of the root node
/// the right child of the
/// root node
public BinaryTree(T value, BinaryTree leftChild,
BinaryTree rightChild)
{
if (value == null)
{
throw new ArgumentNullException("Cannot insert null value!");
}
BinaryTreeNode leftChildNode =
leftChild != null ? leftChild.root : null;
BinaryTreeNode rightChildNode =
rightChild != null ? rightChild.root : null;
}
this.root = new BinaryTreeNode(
value, leftChildNode, rightChildNode);
///
/// Constructs the tree