static void Main(string[] args)
{
Console.WriteLine("Binary Tree Implimentation!");
BinarySearchTree <int> binarySearchTree = new BinarySearchTree <int>(56);
binarySearchTree.Insert(30);
binarySearchTree.Insert(70);
binarySearchTree.Insert(22);
binarySearchTree.Insert(40);
binarySearchTree.Insert(11);
binarySearchTree.Insert(3);
binarySearchTree.Insert(16);
binarySearchTree.Insert(60);
binarySearchTree.Insert(95);
binarySearchTree.Insert(65);
binarySearchTree.Insert(63);
binarySearchTree.Insert(67);
binarySearchTree.Display();
binarySearchTree.GetSize();
binarySearchTree.Search(11, binarySearchTree);
binarySearchTree.Search(75, binarySearchTree);
}
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);
}
