public boolean contains(E e){
		TreeNode<E> current = root;
		while(e.compareTo(current.value) != 0){
			if(e.compareTo(current.value) < 0)
				current = current.left;
			else
				current = current.right;
			if(current == null)
				return false;
		}
		return true;
	}