C Program to delete alternate nodes of a Linked List

#include<stdio.h>
#include<stdlib.h>

//Structure of node 
struct Node
{
  int data;
  struct Node *next;
};

//display the nodes
void display (struct Node *node)
{

  //as linked list will end when Node is Null
  while (node != NULL)
    {
      printf ("%d ", node->data);
      node = node->next;
    }
  printf ("\n");
}

// function to delete alternate nodes
void delete_Alt (struct Node *curr)
{
  if (curr == NULL)
    return;

  // assigning node to current node's next
  struct Node *del_node = curr->next;

  if (del_node == NULL)
    return;

  // changing next node of curr to alternative node
  // del_node is no more part of Linked List
  curr->next = del_node->next;

  // memory for del_node also freed
  free (del_node);

  // Recursively call for the new next of curr
  delete_Alt (curr->next);
}

int main ()
{
  //creating 4 pointers of type struct Node
  //So these can point to address of struct type variable
  struct Node *head = NULL;
  struct Node *node2 = NULL;
  struct Node *node3 = NULL;
  struct Node *node4 = NULL;
  struct Node *node5 = NULL;

  // allocate 4 nodes in the heap 
  head = (struct Node *) malloc (sizeof (struct Node));
  node2 = (struct Node *) malloc (sizeof (struct Node));
  node3 = (struct Node *) malloc (sizeof (struct Node));
  node4 = (struct Node *) malloc (sizeof (struct Node));
  node5 = (struct Node *) malloc (sizeof (struct Node));


  head->data = 5;		// data set for head node 
  head->next = node2;		// next pointer assigned to address of node2 

  node2->data = 4;
  node2->next = node3;

  node3->data = 3;
  node3->next = node4;

  node4->data = 2;
  node4->next = node5;

  node5->data = 1;
  node5->next = NULL;

  printf ("Before deletion: ");
  display (head);

  delete_Alt (head);

  printf ("After deletion: ");
  display (head);
  return 0;
}