BST Searching

BST search()

public boolean search(T data, Node<T> node){
	if(data != null){
		if(data.compareTo(node.getData()) == 0){
			return true;
		}else{
			if(data.compareTo(node.getData()) < 0){
				if(node.left == null){
					return false;
				}else{
					return search(data, node.left);
				}
			}else if(data.compareTo(node.getData()) > 0){
				if(node.right == null){
					return false;
				}else{
					return search(data, node.right);
				}
			}
		}	
	}
	else{
		Node<T> max = root;
		while(max != null){			
			if(max.getData()==null){
				return true;
			}
			max = max.right;
		}
	}
	return false;		
}