//find method
public T find (T Element) {
if (isEmpty())
throw new EmptyCollectionException();
BinaryTreeNode<T> current = getNode((Comparable<T>)Element,root);

if(current==null){
throw new ElementNotFoundException();

return(current.element);
}

//contains method

public boolean contains(T Element){

BinaryTreeNode<T> current = getNode((Comparable<T>)targetElement, root);

if (current == null)
return false;
else
return true;
}

//getNode Method

private BinaryTreeNode<T> getNode(Comparable<T>Element,BinaryTreeNode<T>,next){
BinaryTreeNode<T> current = next;

if(current == null)
return null;

else if(Element.compareTo(current.element)==0)
return current;

else if(Element.compareTo(current.element)<0)
current = getNode(Element,current.left);

else
current = getNode(Element,current.right);

return current;
}