C++ program for insertion in a Sorted Linked List

#include<iostream>
using namespace std;

struct node
{
  int data;
  struct node *next;
};
void build (struct node **head, int data);
void display (struct node *head);
void sortedInsert (struct node **head, struct node *newNode);
struct node *newNode (int data);

int main (void)			//main method.
{
  int n, k;
  cout << "Enter size of linked list\n"; cin >> n;
  int data[100];
  cout << "Enter linked list data in sorted order\n";

  struct node *head = NULL;

  cout << "Linked list before insertion\nLinked List Data: ";
  display (head);
  for (int i = 0; i < n; i++)
    {
      cout << "\nEnter data you want to insert: "; cin >> k;
      sortedInsert (&head, newNode (k));
    }
  cout << "\nLinked list after insertion\nLinked List Data: "; display (head); return 0; } void build (struct node **head, int data) //function to build linked list { struct node *newNode = (struct node *) malloc (sizeof (struct node)); newNode->data = data;
  newNode->next = *head;
  *head = newNode;
}

void display (struct node *head)	//function to print linked list
{
  struct node *ptr = head;
  while (ptr)
    {
      cout << ptr->data << " "; ptr = ptr->next;
    }
}

struct node *newNode (int data)
{
  struct node *newNode = (struct node *) malloc (sizeof (struct node));
  newNode->data = data;
  newNode->next = NULL;
  return newNode;
}

void sortedInsert (struct node **head, struct node *newNode)
//function to insert data in sorted position
{
  //If linked list is empty
  if (*head == NULL || (*head)->data >= newNode->data)
    {
      newNode->next = *head;
      *head = newNode;
      return;
    }

  //Locate the node before insertion
  struct node *current = *head;
  while (current->next != NULL && current->next->data < newNode->data)
    current = current->next;

  newNode->next = current->next;
  current->next = newNode;
}