static void Main(string[] args)
{
BinarySearchTree bst = new BinarySearchTree();
bst.AddNode(15);
bst.AddNode(10);
bst.AddNode(7);
bst.AddNode(50);
bst.AddNode(12);
bst.AddNode(11);
bst.AddNode(45);
bst.AddNode(13);
bst.AddNode(55);
bst.AddNode(14);
if (bst.Search(12))
{
Console.WriteLine("Found");
}
else
{
Console.WriteLine("Not found");
}
if (bst.Search(60))
{
Console.WriteLine("Found");
}
else
{
Console.WriteLine("Not found");
}
bst.Inorder();
bst.Preorder();
bst.Postorder();
int size = bst.Size();
Console.WriteLine($"The number of nodes in the tree :{size}");
if (bst.Search(10))
{
bst.DeleteNode(10);
}
else
{
Console.WriteLine("Item is not in the tree");
}
bst.Preorder();
size = bst.Size();
Console.WriteLine($"The number of nodes in the tree :{size}");
bst.MakeEmpty();
bst.Preorder();
size = bst.Size();
Console.WriteLine($"The number of nodes in the tree :{size}");
Console.Read();
}
static void Main(string[] args)
{
BinarySearchTree <string> BSTflowers = new BinarySearchTree <string>("sunflower");
BSTflowers.AddNode("daisy");
BSTflowers.AddNode("poppy");
BSTflowers.AddNode("rose");
BSTflowers.AddNode("lily");
BSTflowers.AddNode("tulip");
BSTflowers.AddNode("orchid");
BSTflowers.AddNode("peonies");
BSTflowers.AddNode("marigold");
BSTflowers.AddNode("buttercup");
BSTflowers.AddNode("chrysanthemum");
BSTflowers.AddNode("iris");
Console.WriteLine();
PrintList(BSTflowers.InOrder("sunflower"));
Console.WriteLine();
BSTflowers.Remove("marigold");
Console.WriteLine(BSTflowers.Contains("marigold"));
Console.WriteLine(BSTflowers.Contains("iris"));
Console.WriteLine();
BSTflowers.Remove("iris");
PrintList(BSTflowers.InOrder("lily"));
Console.WriteLine();
PrintList(BSTflowers.InOrder("sunflower"));
Console.Read();
}
static void Main(string[] args)
{
Console.WriteLine("Binary Tree search");
BinarySearchTree <int> BinaryTree = new BinarySearchTree <int>();
///<summary>
///UC1: Add the node in the tree
/// </summary>
BinaryTree.AddNode(56);
BinaryTree.AddNode(30);
BinaryTree.AddNode(70);
BinaryTree.AddNode(22);
BinaryTree.AddNode(40);
BinaryTree.AddNode(11);
BinaryTree.AddNode(63);
BinaryTree.AddNode(67);
BinaryTree.AddNode(16);
BinaryTree.AddNode(60);
BinaryTree.AddNode(95);
BinaryTree.AddNode(65);
BinaryTree.AddNode(3);
///<summary>
///UC2:Find the size of tree
/// </summary>
int Size = BinaryTree.GetSize();
Console.WriteLine(Size);
///<summary>
///UC3:Serach node through the tree
/// </summary>
bool result = BinaryTree.SearchKey(63);
Console.WriteLine(result);
}
