//===============Main Method================
static void Main(string[] args)
{
BinarySearchTree bst = new BinarySearchTree();
bst.add(5);
bst.add(3);
bst.add(4);
bst.add(3);
bst.add(6);
bst.add(5);
bst.add(7);
Console.Out.WriteLine("======Binary Search Tree Test 1======");
Console.Out.WriteLine(">Tests whether or not the tree contians all the values it was constructed with");
Console.Out.WriteLine(bst.hasValue(5) && bst.hasValue(3) && bst.hasValue(4) && bst.hasValue(6) && bst.hasValue(7) && !bst.hasValue(10));
Console.Out.WriteLine("");
Console.Out.WriteLine("======Binary Search Tree Test 2======");
Console.Out.WriteLine(">Tests whether or not the tree is of height 4");
Console.Out.Write("bst.getHeight(): ");
Console.Out.WriteLine(bst.getHeight());
Console.Out.WriteLine(bst.getHeight() == 4);
Console.Out.WriteLine("");
Console.Out.WriteLine("======Binary Search Tree Test 3======");
Console.Out.WriteLine(">Tests (by inspection) a preorder traversal");
bst.preorderTraversal();
Console.Out.WriteLine();
Console.Out.WriteLine("======Binary Search Tree Test 4======");
Console.Out.WriteLine(">Tests (by inspection) a inorder traversal");
bst.inOrderTraversal();
Console.Out.WriteLine();
Console.Out.WriteLine("======Binary Search Tree Test 5======");
Console.Out.WriteLine(">Tests (by inspection) a postorder traversal");
bst.postOrderTraversal();
Console.Out.WriteLine();
bst.deleteValue(5);
Console.Out.WriteLine("======Binary Search Tree Test 6======");
Console.Out.WriteLine(">Tests (by inspection) whether or not a delete has worked");
Console.Out.Write("Post-Order Traversal: ");
bst.postOrderTraversal();
Console.Out.Write("Pre-Order Traversal: ");
bst.preorderTraversal();
Console.Out.Write("In-Order Traversal: ");
bst.inOrderTraversal();
}
