Linked List in C

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

struct Node
{
  int data;
  struct Node *next;
};


void
insertFirst (struct Node **head, int data)
{

  // dynamically create memory for this newNode
  struct Node *newNode = (struct Node *) malloc (sizeof (struct Node));

  // assign data value
  newNode->data = data;
  // change the next node of this newNode 
  // to current head of Linked List
  newNode->next = *head;

  //re-assign head to this newNode
  *head = newNode;
}

void
deleteFirst (struct Node **head)
{
  struct Node *temp = *head;

  // if there are no nodes in Linked List can't delete
  if (*head == NULL)
    {
      printf ("Linked List Empty, nothing to delete");
      return;
    }

  // move head to next node
  *head = (*head)->next;

  printf ("\n%d deleted\n\n", temp->data);
  free (temp);
}

void
display (struct Node *node)
{
  printf ("Linked List : \n");

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

void
search (struct Node *node, int key)
{

  int pos = 1;
  int flag = 0;
  while (node != NULL)
    {
      if (node->data == key)
	{
	  flag = 1;
	  break;
	}
      node = node->next;
      pos++;
    }
  if (flag)
    printf ("%d present at %d position\n", key, pos);
  else
    printf ("%d not present\n");
}

// Note by default insertion/deletion happens at starting node
// of Linked List
int
main ()
{
  struct Node *head = NULL;

  // Need '&' i.e. address as we need to change head
  insertFirst (&head, 50);
  insertFirst (&head, 40);
  insertFirst (&head, 30);
  insertFirst (&head, 20);
  insertFirst (&head, 10);

  // no need of '&' as we are not changing head just displaying Linked List
  display (head);

  search (head, 30);
  search (head, 100);

  deleteFirst (&head);

  display (head);

  return 0;
}