static void Main(string[] args)
{
BinarySearchTree bst = new BinarySearchTree();
int userInput = -1;
do
{
Console.Clear();
userInput = DisplayMenu();
Console.Clear();
switch (userInput)
{
case 1:
//bst.generateTree();
bst.Insert(getNumber("Enter number to be inserted: "));
continuation();
break;
case 2:
bst.Delete(getNumber("Enter number to be deleted: "));
continuation();
break;
case 3:
bst.Display();
continuation();
break;
default:
Console.WriteLine("Action unsucessful: Invalid code!");
break;
}
} while (userInput != 0);
}
public void Run()
{
//Node root = BuildTree();
BinarySearchTree bst = new BinarySearchTree();
int[] values = new int[] { 8, 10, 7, 16, 14, 11, 1, 3, 5, 13 };
Node root = null;
foreach (int v in values)
{
root = bst.Insert(root, v);
}
PrintTree(root, "Insert: ");
PrintNode(bst.Search(root, 8), "Search 8: ");
PrintNode(bst.Search(root, 9), "Search 9: ");
// PrintTree(bst.DeleteMin(root), "DeleteMin: ");
// PrintTree(bst.DeleteMax(root), "DeleteMax: ");
PrintTree(bst.Delete(root, 8), "Delete 8: ");
// PrintTree(bst.Delete(root, 12), "Delete 12: ");
}
