Linked list program in c++ end element deletion and insertion

 /*Delete/insert in end element*/

#include <iostream>

using namespace std;

/* Structure of a node */
struct node {
    int data;          // Data
    struct node *next; // Address
}*head;

void createList(int n);
void insertNodeAtEnd(int data);
void deleteLastNode();
void displayList();

int main()
{
    int n, data,choice;

    /*
     * Create a singly linked list of n nodes
     */
    cout<<("Enter the total number of nodes: ");
    cin>>(n);
    createList(n);

    cout<<("\nData in the list \n");
    displayList();

    /*
     * Insert data at the end of the singly linked list
     */
    cout<<("\nEnter data to insert at end of the list: ");
    cin>>(data);
    insertNodeAtEnd(data);

    cout<<("\nPress 1 to delete last node: ");
    cin>>(choice);

    /* Delete last node from list */
    if(choice == 1)
        deleteLastNode();

    cout<<("\nData in the list \n");
    displayList();

    return 0;
}

/*
* Create a list of n nodes
*/
void createList(int n)
{
    struct node *newNode, *temp;
    int data, i;

    head = (struct node *)malloc(sizeof(struct node));

    /*
     * If unable to allocate memory for head node
     */
    if(head == NULL)
    {
        cout<<("Unable to allocate memory.");
    }
    else
    {
        /*
         * Reads data of node from the user
         */
        cout<<("Enter the data of node 1: ");
        cin>>(data);

        head->data = data; // Link the data field with data
        head->next = NULL; // Link the address field to NULL

        temp = head;

        /*
         * Create n nodes and adds to linked list
         */
        for(i=2; i<=n; i++)
        {
            newNode = (struct node *)malloc(sizeof(struct node));

            /* If memory is not allocated for newNode */
            if(newNode == NULL)
            {
                printf("Unable to allocate memory.");
                break;
            }
            else
            {
                cout<<"Enter the data of node "<<i<<":";
                cin>>(data);

                newNode->data = data; // Link the data field of newNode with data
                newNode->next = NULL; // Link the address field of newNode with NULL

                temp->next = newNode; // Link previous node i.e. temp to the newNode
                temp = temp->next;
            }
        }

        cout<<("SINGLY LINKED LIST CREATED SUCCESSFULLY\n");
    }
}

/*
* Create a new node and inserts at the end of the linked list.
*/
void insertNodeAtEnd(int data)
{
    struct node *newNode, *temp;

    newNode = (struct node*)malloc(sizeof(struct node));

    if(newNode == NULL)
    {
        cout<<("Unable to allocate memory.");
    }
    else
    {
        newNode->data = data; // Link the data part
        newNode->next = NULL;

        temp = head;

        // Traverse to the last node
        while(temp != NULL && temp->next != NULL)
            temp = temp->next;

        temp->next = newNode; // Link address part

        cout<<("DATA INSERTED SUCCESSFULLY\n");
    }
}

/*
* Display entire list
*/
void displayList()
{
    struct node *temp;

    /*
     * If the list is empty i.e. head = NULL
     */
    if(head == NULL)
    {
        cout<<("List is empty.");
    }
    else
    {
        temp = head;
        while(temp != NULL)
        {
            cout<<"Data =" <<temp->data<<"\n"; // Print data of current node
            temp = temp->next;                 // Move to next node
        }
    }
}

/*
* Delete last node of the linked list
*/
void deleteLastNode()
{
    struct node *toDelete, *secondLastNode;

    if(head == NULL)
    {
        cout<<("List is already empty.");
    }
    else
    {
        toDelete = head;
        secondLastNode = head;

        /* Traverse to the last node of the list */
        while(toDelete->next != NULL)
        {
            secondLastNode = toDelete;
            toDelete = toDelete->next;
        }

        if(toDelete == head)
        {
            head = NULL;
        }
        else
        {
            /* Disconnect link of second last node with last node */
            secondLastNode->next = NULL;
        }

        /* Delete the last node */
        free(toDelete);

        cout<<("SUCCESSFULLY DELETED LAST NODE OF LIST\n");
    }
}