public void insertAt(int index, LinkedList<T> list, Node<T> newNode) {
		if (!indexCheck(index))
			return;
		if (index == 0) {
			Node<T> oldStart = this.start;
			this.start = newNode;
			this.start.setTail(oldStart);
			length++;
			last = newNode;
			return;
		} else {
			Node<T> currentNode = this.start;
			for (int n = 0; n < index - 1; n++) {
				currentNode = currentNode.getTail();
			}
			Node<T> oldNext = currentNode.getTail();
			currentNode.setTail(newNode);
			newNode.setTail(oldNext);
			length++;
			last = newNode;
		}
	}