public MyBinaryNode <K> search(MyBinaryNode <K> current, K key)
{
if (current.key.CompareTo(key) > 0 || current.key.CompareTo(key) < 0)
{
int compareResult = key.CompareTo(current.key);
if (compareResult < 0)
{
current.left = search(current.left, key);
}
else
{
current.right = search(current.right, key);
}
}
Console.WriteLine(" Key is searched:" + key);
return(current);
}
public MyBinaryNode <K> addRecursively(MyBinaryNode <K> current, K key)
{
if (current == null)
{
return(new MyBinaryNode <K>(key));
}
int compareResult = key.CompareTo(current.key);
if (compareResult == 0)
{
return(current);
}
if (compareResult < 0)
{
current.left = addRecursively(current.left, key);
}
else
{
current.right = addRecursively(current.right, key);
}
return(current);
}
public MyBinaryNode(K key)
{
this.key = key;
this.left = null;
this.right = null;
}
public int getSizeRecursive(MyBinaryNode <K> current)
{
return(current == null ? 0 : 1 + this.getSizeRecursive(current.left)
+ this.getSizeRecursive(current.right));
}
public void add(K key)
{
this.root = this.addRecursively(root, key);
}
