public void add(T t, Comparator<T> comp) {
	if (head != null) {
		Node<T> current = head;
		Node<T> next = current.getNext();
		while (comp.compare(t, current.getObject()) > 0) {
			if (next == null) {
				addToEnd(t);
				return;
			} else if (comp.compare(t, next.getObject()) <= 0) {
				Node<T> objectNode = new Node<T>(t);
				current.setNext(objectNode);
				objectNode.setNext(next);
				currentSize++;
				return;
			} else {
				current = next;
				next = current.getNext();
			}
		}
	} else {
		addToStart(t);
	}
}