Linked list

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

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

void operateLinkedList() {
    int n;
    scanf("%d", &n);
    struct Node* head = NULL;

    for (int i = 0; i < n; i++) {
        int data;
        scanf("%d", &data);

        struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
        newNode->data = data;
        newNode->next = NULL;

        if (head == NULL) {
            head = newNode;
        } else {
            struct Node* temp = head;
            while (temp->next != NULL) {
                temp = temp->next;
            }
            temp->next = newNode;
        }
    }

    struct Node* temp = head;
    printf("Elements are:\n");
    while (temp != NULL) {
        printf("%d\n", temp->data);
        temp = temp->next;
    }

    if (head == NULL) {
        printf("List is empty\n");
    } else {
        struct Node* prev = NULL;
        temp = head;
        while (temp->next != NULL) {
            prev = temp;
            temp = temp->next;
        }
        if (prev == NULL) {
            head = NULL;
        } else {
            prev->next = NULL;
        }
        printf("Deleted element is %d\n", temp->data);
        free(temp);

        if (head == NULL) {
            printf("List is empty\n");
        } else {
            temp = head;
            printf("Elements are:\n");
            while (temp != NULL) {
                printf("%d\n", temp->data);
                temp = temp->next;
            }
        }
    }

    struct Node* temp1;
    while (head != NULL) {
        temp1 = head;
        head = head->next;
        free(temp1);
    }
}

int main() {
    operateLinkedList();
    return 0;
}