A question about the implementation

[Dan-k391]

As knowing the node to remove, why traverse the linked list instead of doing something such as:

target->value=target->next->value;
target->next=target->next->next;

[0rtz]

Previous item to target will still point to target

[ckwastra]

Recall that in our example, target is a pointer to the item to be removed, not a pointer to the previous item to be searched, which doesn't even exist in case of removing the first item.

[Basa198]

That works as long as the element is not last in the list. You are basically rewriting the target element to be the same as the next and then deleting the next one, so the result is that the target is deleted. If there is no next element, there is nothing to duplicate and delete. We need a pointer to the previous item in this case, which is what ckwastra pointed out, I think.