Delete alternate node of the linked list

Given a Singly Linked List. Write code to delete alternate nodes from that list.

For example: If the list given is

2 -> 3 -> 5 -> 1 -> 4 -> 8

2 -> 5 -> 4

Solution:

This is an easier one (compared to the usual code I put in this section). But there are a few loopholes where students can get stuck. Let me write the code straight away:

We will take 2 points (head & next). next pointer will point to the node being deleted and head will point its previous node. In each loop we will delete the node pointed to by next pointer and we will reset the pointers.

void deleteAlternate(Node* head)
{
    // If thethe list is empty or has only 1 node
    if(head == NULL || head->link == NULL)
        return;
    Node * next = head->link;
    while(next != NULL)
    {
        head->link = next->link;
        delete next;
        // Make head & next, point to the next set of nodes
        head = head->link;
        if(head != null)
            next = head->link;
        else
            next = null;
    }
}