static void Main(string[] args)
{
BinarySearchTree <int> binarySearch = new BinarySearchTree <int>(56);
binarySearch.Insert(30);
binarySearch.Insert(70);
binarySearch.Insert(22);
binarySearch.Insert(40);
binarySearch.Insert(60);
binarySearch.Insert(95);
binarySearch.Insert(11);
binarySearch.Insert(65);
binarySearch.Insert(3);
binarySearch.Insert(16);
binarySearch.Insert(63);
binarySearch.Insert(67);
//binarySearch.Display();
bool result = binarySearch.IfExists(63, binarySearch);
Console.WriteLine(result);
Console.ReadKey();
}
static void Main(string[] args)
{
Console.WriteLine("Welcome to the Binary Search Tree Program");
BinarySearchTree <int> bst = new BinarySearchTree <int>(56);
bst.Insert(56);
bst.Insert(30);
bst.Insert(70);
bst.Insert(22);
bst.Insert(40);
bst.Insert(60);
bst.Insert(95);
bst.Insert(11);
bst.Insert(65);
bst.Insert(3);
bst.Insert(16);
bst.Insert(63);
bst.Insert(67);
bst.Display();
bst.GetSize();
bst.IfExists(100, bst);
}
static void Main(string[] args)
{
BinarySearchTree <int> binarySearchTree = new BinarySearchTree <int>(56);
binarySearchTree.Insert(30);
binarySearchTree.Insert(70);
binarySearchTree.Display();
Console.WriteLine("-----------------------");
binarySearchTree.Insert(40);
binarySearchTree.Insert(22);
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();
Console.WriteLine("------------------------");
binarySearchTree.IfExists(67, binarySearchTree);
}
