For a binary search tree that has a Node with three elements, data, a leftchild pointer and a rightChild pointer, write the Java code for a recursive find method that accepts a temporary node and has this signature: private boolean find(Node currentNode, E toFind) { Solution private boolean find(Node currentNode, int toFind) { if (currentNode != null) { } else { private boolean find(Node currentNode, int toFind) { if (currentNode != null) {// check if current node has the element we are looking forif (currentNode.data == toFind) return true; } else {// check if the sub treesreturn find(currentNode.left, toFind) || find(currentNode.right, toFind);}}return false;}.

1. For a binary search tree that has a Node with three elements, data, a leftchild pointer and a
rightChild pointer, write the Java code for a recursive find method that accepts a temporary node
and has this signature: private boolean find(Node currentNode, E toFind) {
Solution
private boolean find(Node currentNode, int toFind)
{
if (currentNode != null)
{
}
else
{
private boolean find(Node currentNode, int toFind)
{
if (currentNode != null)
{// check if current node has the element we are looking forif (currentNode.data == toFind)
return true;
}
else
{// check if the sub treesreturn find(currentNode.left, toFind) || find(currentNode.right,
toFind);}}return false;}