Deletion from specific position in circular linked list in C++

#include<iostream>
using namespace std;

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

void insertStart (struct Node **head, int data)	//function to create linked list
{
  struct Node *newNode = (struct Node *) malloc (sizeof (struct Node));
  newNode->num = data;

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

      cout << newNode->num << " Inserted\n"; return; 
        
    } // if CLL already as >=1 node
  struct Node *curr = *head;

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

  curr->next = newNode;		// last node's next as this new node
  newNode->next = *head;	// new node's next as current head node

  *head = newNode;		// changing head node to this new node
  cout << newNode->num << " Inserted\n"; // previous head node becomes 2nd node 
  }
  void deleteBegin (struct Node **head) //function to delete beginning node from the circular linked list 
  { 
      struct Node *p, *temp; p = *head;
      while (p->next != (*head))
    {
      p = p->next;
    }
  temp = *head;
  p->next = (*head)->next;
  *head = (*head)->next;

  free (temp);
}

void deleteSpecific (struct Node **head, int pos)	//function to delete any node from the list
{
  if (pos < 1)
    {
      cout << "Invalid position entered";
      }
      else if (pos == 1) { 
          deleteBegin (head); 
          
      } 
      else { 
          struct Node *p, *q; 
          int del, k = 0; 
          del = pos - 1; p = *head;
          while (k != del) {
              q = p;
              p = p->next;
	  k++;
	}
      q->next = p->next;
      free (p);			//deleting specific node
    }				//deleting specific node
}

void display (struct Node *head)
{

  cout << "\nCircular Linked List : " << endl;

  // if circular linked list is empty currently
  if (head == NULL)
    return;

  struct Node *temp = head;

  // since we need to take care of circular nature of linked list
  do
    {
      cout << temp->num << " "; temp = temp->next;

    }
  while (temp != head);
  cout << endl;
}

int main ()				//main function
{
  // first node will be null at creation    
  struct Node *head = NULL;

  insertStart (&head, 1);
  insertStart (&head, 2);
  insertStart (&head, 3);
  insertStart (&head, 4);
  insertStart (&head, 5);
  cout << "Before deletion ";
  display (head);
  deleteSpecific (&head, 5);
  cout << "After deletion ";
  display (head);
  return 0;
}