static void BinarySearchTreePrintString()
{
var array = new string[]
{
"dog",
"cat",
"bird",
"rabbit",
"frog",
"fox",
"cow",
"squirrel",
"mouse"
};
var bst = new BinarySearchTree <string>(Comparer <string> .Create((x, y) => x.CompareTo(y)), null, true);
bst.Add(array);
Console.WriteLine($"The depth is {bst.GetTreeDepth()}");
Console.WriteLine("Attempt to Find 9");
Console.WriteLine(bst.Find("bird").Data);
Hr();
Console.WriteLine("Attempt to Remove 9");
bst.Remove("fox");
Hr();
Console.WriteLine("PreOrder Traversal");
bst.TraversePreOrder();
Hr();
Console.WriteLine("InOrder Traversal");
bst.TraverseInOrder();
Hr();
Console.WriteLine("PostOrder Traversal");
bst.TraversePostOrder();
Hr();
}
