public void MakeEmpty() { Root = null; }
public BinaryTree(T value) { Root = new BinaryNode <T>(value); }
public BinaryNode <T> AddRightChild(T value) { RightChild = new BinaryNode <T>(value); return(RightChild); }
public BinaryNode <T> AddLeftChild(T value) { LeftChild = new BinaryNode <T>(value); return(LeftChild); }
public BinaryNode(T value, BinaryNode <T> leftChild, BinaryNode <T> rightChild) { Value = value; LeftChild = leftChild; RightChild = rightChild; }
public BinaryNode(T value) { Value = value; LeftChild = null; RightChild = null; }