please answer in java

Implement the search method of a 'Binary Searchtree class. You may me the two private class Node) private Nodect data) this data - data; 3 private T data; private Node left; private Node right; } You may decide to implement the method recursively or not. Your method must return true the value is found and is not found. Hint: recursively is easier