void Linkedlist<T>::insert(T value)
{
	Node* newNode = new Node();

	newNode->value = value;
	newNode->next = nullptr;
	size++;
	cout << "size: " << size << " value: " << newNode->value << endl;
	if (size == 1)
		start = newNode;
	else {
		Node* indexPtr = start;
		while (indexPtr->next != nullptr)
			indexPtr = indexPtr->next;
		indexPtr->next = newNode;
	}
}