@Override
	public E remove(E obj) {
		E tmpObj = null;
		Node iterObj = frontNode;

		while (iterObj != null) {
			if(((Comparable<E>)iterObj.data).compareTo(obj) == 0) {
				tmpObj = (E) iterObj.data; 		// Keep data to return
				Node tmpNode = iterObj;

				System.out.println("\n\n\n" + tmpObj + "\n\n\n");



				if(iterObj.last == null)
					return removeFirst();
				if(iterObj.next == null)
					return removeLast();

				iterObj.last.next = iterObj.next;
				iterObj.next.last = iterObj.last;
				listSize--;

				break;
			} else {
				iterObj = iterObj.next;
			}
		}

		return (E) tmpObj;
	}