1: public T getEntry(T entry)
2: {
3: return findEntry(getRootNode(), entry);
4: } // end getEntry
5:
6: private T findEntry(BinaryNode<T> rootNode, T entry)
7: {
8: T result = null;
9:
10: if (rootNode != null)
11: {
12: T rootEntry = rootNode.getData();
13:
14: if (entry.equals(rootEntry))
15: result = rootEntry;
16: else if (entry.compareTo(rootEntry) < 0)
17: result = findEntry(rootNode.getLeftChild(), entry);
18: else
19: result = findEntry(rootNode.getRightChild(), entry);
20: } // end if
21:
22: return result;
23: } // end findEntry
24: // Version 4.0