Generic Linked list in C

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

// Define a structure for a generic linked list node
typedef struct Node {
    void* data;            // Pointer to the data (generic)
    struct Node* next;     // Pointer to the next node
} Node;

// Function to create a new node with generic data
Node* createNode(void* data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    if (newNode == NULL) {
        perror("Memory allocation failed");
        exit(EXIT_FAILURE);
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

// Function to insert a node at the beginning of the list
void insertAtBeginning(Node** head, void* data) {
    Node* newNode = createNode(data);
    newNode->next = *head;
    *head = newNode;
}

// Function to print the elements of the list (assuming int data)
void printList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        printf("%d ", *(int*)(current->data));
        current = current->next;
    }
    printf("\n");
}

// Function to free the memory used by the list
void freeList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        Node* temp = current;
        current = current->next;
        free(temp->data);  // Free the data pointer
        free(temp);        // Free the node
    }
}

int main() {
    Node* head = NULL;

    // Insert elements of different types (int and double) into the list
    int num1 = 42;
    double num2 = 3.14;

    insertAtBeginning(&head, &num1);
    insertAtBeginning(&head, &num2);

    // Print the list
    printf("List elements: ");
    printList(head);

    // Free the memory used by the list
    freeList(head);

    return 0;
}