View difference between Paste ID: agKcUdxa and Wt8QXdav

 void Linkedlist<T>::insert(T value)
 {
 	Node* newNode = new Node();
 
-	if (size == 0) //with out that it gives me error
+
 	newNode->next = nullptr;
 	size++;
 	cout << "size: " << size << " value: " << newNode->value << endl;
 	if (size == 1)
 		start = newNode;
 	else {
-	Node* indexPtr = start;
+		Node* indexPtr = start;
 		while (indexPtr->next != nullptr)
-	while (indexPtr->next != nullptr)
+			indexPtr = indexPtr->next;
-		indexPtr = indexPtr->next;
+		indexPtr->next = newNode;
 	}
-	indexPtr->next = newNode;
+