/// <summary>
/// Searching for an element
/// </summary>
/// <param name="element"></param>
/// <param name="node"></param>
/// <returns></returns>
public bool Search(T element, MyBinaryTree <T> node)
{
///checking for the node first if not null
///then checking for the node data if not equal to element
///then comparing the nodedata with element to search in either left tree or right tree
///using recursion
if (node == null)
{
Console.WriteLine("The element {0} is not present in the Binary search tree", element);
return(false);
}
if (node.nodeData.Equals(element))
{
Console.WriteLine("The element {0} is present in Binary search Tree", element);
return(true);
}
else
{
Console.WriteLine("we are currently on {0} node", node.nodeData);
}
if (node.nodeData.CompareTo(element) > 0)
{
return(Search(element, node.leftTree));
}
else
{
return(Search(element, node.rightTree));
}
}
/// <summary>
/// Inserting values in Binary Search Tree
/// UC1
/// </summary>
/// <param name="item"></param>
public void Insert(T item)
{
///copying the value of nodeData into currentnodevalue
///following inorder
///comparing if the value entered is greater than current node or less than
///if less than currentnodevalue then adding into left tree
///if greater than adding into right tree
T currentNodeValue = this.nodeData;
if (currentNodeValue.CompareTo(item) > 0)
{
///after this checking if left tree is null or not
///if null then crating a new mybinarytree for left node and passing item
///otherwise inserting in the already existing leftnode
if (this.leftTree == null)
{
this.leftTree = new MyBinaryTree <T>(item);
Console.WriteLine("Inserting {0} on left", item);
}
///for recursion remember first it will reach the end node and also traverse back to upper nodes
else
{
this.leftTree.Insert(item);
}
}
else
{
///if compare to function gives -1 then else block is followed
///same steps are followed as in left value
///using recursion to insert values in left and right tree
if (this.rightTree == null)
{
this.rightTree = new MyBinaryTree <T>(item);
Console.WriteLine("Inserting {0} on the right", item);
}
else
{
this.rightTree.Insert(item);
}
}
}
/// <summary>
/// Calling functions from MyBinaryTree
/// </summary>
/// <param name="args"></param>
static void Main(string[] args)
{
Console.WriteLine(" Welcome to Binary Search Tree");
MyBinaryTree <int> myBinaryTree = new MyBinaryTree <int>(56);
myBinaryTree.Insert(30);
myBinaryTree.Insert(70);
myBinaryTree.Insert(22);
myBinaryTree.Insert(40);
myBinaryTree.Insert(60);
myBinaryTree.Insert(95);
myBinaryTree.Insert(11);
myBinaryTree.Insert(65);
myBinaryTree.Insert(3);
myBinaryTree.Insert(16);
myBinaryTree.Insert(63);
myBinaryTree.Insert(67);
Console.WriteLine("Displaying Binary Search Tree");
myBinaryTree.Display();
Console.WriteLine("Searching an element");
myBinaryTree.Search(63, myBinaryTree);
myBinaryTree.Search(12, myBinaryTree);
}
/// <summary>
/// Parameterised Constructor
/// </summary>
/// <param name="nodeData"></param>
public MyBinaryTree(T nodeData)
{
this.nodeData = nodeData;
this.leftTree = null;
this.rightTree = null;
}
