Remove all nodes in linked list

Question

I have a linked list contains 3 nodes like the image shown:

There is a head pointe

Answer 1

temp1 = head->next;

while(temp1!=NULL) // as I am considering tail->next = NULL
{
    head->next = temp1->next;
    temp1->next = NULL;
    free(temp1);
    temp1 = head->next;
}

The logic for this would be more correct if it is this way.

After the statement

free(temp1);

Add the condition

if (head -> next != NULL)
    temp1 = head->next;

Since after deleting the last node there is no point in reassigning the address of head pointer to temp1.