public Comparable find(Comparable x){
  nullNode.element=x;
  current=header.right;
  for (; ; ) {
    if (x.compareTo(current.element) < 0)     current=current.left;
 else     if (x.compareTo(current.element) > 0)     current=current.right;
 else     if (current != nullNode)     return current.element;
 else     return null;
  }
}

public Comparable find ( Comparable x ) { nullNode . element = x ; current = header . right ; for ( ; ; ) { if ( x . compareTo ( current . element ) < 0 ) current = current . left ; else if ( x . compareTo ( current . element ) > 0 ) current = current . right ; else if ( current != nullNode ) return current . element ; else return null ; } }
find an item in the tree .
