public T getEntry(T entry)
{
   return findEntry(getRootNode(), entry);
} // end getEntry

private T findEntry(BinaryNode<T> rootNode, T entry)
{
   T result = null;

   if (rootNode != null)
   {
      T rootEntry = rootNode.getData();

      if (entry.equals(rootEntry))
         result = rootEntry;
      else if (entry.compareTo(rootEntry) < 0)
         result = findEntry(rootNode.getLeftChild(), entry);
      else
         result = findEntry(rootNode.getRightChild(), entry);
   } // end if

   return result;
} // end findEntry
// Version 4.0