Count nodes in circular linked list

#include<stdio.h>
#include<stdlib.h>
struct Node
{
  int data;
  struct Node *next;
};

int count(struct Node *head)//function to count number of nodes
{
    int cnt = 0;
    struct Node *cur = head;

    //Iterating till end of list
    do 
    {
        cur = cur->next;
        cnt++;
    } while (cur != head);

    return cnt;
}

void insertStart (struct Node **head, int data)
{
  struct Node *newNode = (struct Node *) malloc (sizeof (struct Node));
  newNode->data = data;

  // if its the first node being entered
  if (*head == NULL)
    {
      *head = newNode;
      (*head)->next = *head;
      return;
    }

  struct Node *curr = *head;

  // traverse till last node in LL
  while (curr->next != *head)
    {
      curr = curr->next;
    }

  curr->next = newNode;
  newNode->next = *head;
  *head = newNode;
}

void display (struct Node *head)
{
  // if there are no node in LL
  if (head == NULL)
    return;

  struct Node *temp = head;

  //need to take care of circular structure of LL
  do
    {
      printf ("%d ", temp->data);
      temp = temp->next;

    }
  while (temp != head);
  printf ("\n");
}

int main ()				//main function
{
  struct Node *head = NULL;
  struct Node *head1 = NULL;
  struct Node *head2 = NULL;

  insertStart (&head, 6);
  insertStart (&head, 5);
  insertStart (&head, 4);
  insertStart (&head, 3);
  insertStart (&head, 2);
  insertStart (&head, 1);

  printf ("Linked List is: ");
  display (head);

  printf("Total number of nodes are: %d",count(head));
  
  return 0;
}