public void Clear() { RootNode = new BinaryTreeNode <T>(); Count = 0; }
public bool Contains(T value) { BinaryTreeNode <T> result = FindNodeByValue(RootNode, value); return(result != null); }
public BinarySearchTree() { RootNode = new BinaryTreeNode <T>(); }