二叉排序树

public class BinaryNode<AnyType>{

　　　BinaryNode(AnyType e){
              this(e,null,null);
　　　}
         BinaryNode(AnyType e, BinaryNode l,BinaryNode r){
              element = e;
              left = l;
              right = r;  
         } 

          AnyType element;
          BinaryNode left;
          BinaryNode right;
         
}   

public boolean contains(AnyType x;BinaryNode<AnyType> t ){
        if(t == null ) return false;
   
        if(x<t.element){
              contains(x,t.left)
        }   else if(x>t.element){
               contains(x,t.right)
         }  else {
               return true;
         }
}