public DoublyLinkedList(BiNode <T> head, BiNode <T> tail)
{
Head = head;
Tail = tail;
}
public BinarySearchTree(BiNode <T> root)
{
Root = root;
}
public static DoublyLinkedList <T> ConvertFrom(BinarySearchTree <T> treeNode)
{
BiNode <T> root = treeNode.Root;
return(ConvertFromRecurse(root));
}