#include <stdio.h>

#include <stdlib.h>

​

// Node structure

struct Node {

    int data;

    struct Node* next;

};

​

// Function to push a new element onto the stack (add to the beginning of the linked list)

void push(struct Node** head, int newData) {

    // Create a new node

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

    if (newNode == NULL) {

        fprintf(stderr, "Memory allocation failed.\n");

        exit(EXIT_FAILURE);

    }

​

    // Set the data and next pointer of the new node

    newNode->data = newData;

    newNode->next = *head;

​

    // Update the head to point to the new node

    *head = newNode;

}

​

// Function to print the elements of the linked list

void printList(struct Node* head) {

    while (head != NULL) {

        printf("%d ", head->data);

        head = head->next;

    }

    printf("\n");

}

​

// Function to free the memory allocated for the linked list

void freeList(struct Node* head) {

    struct Node* temp;

    while (head != NULL) {

        temp = head;

        head = head->next;

        free(temp);

    }

}

​

// Example usage

int main() {

    // Create an empty linked list

    struct Node* head = NULL;

​

    // Push elements onto the stack

    push(&head, 3);

    push(&head, 7);

    push(&head, 1);

    push(&head, 4);

​

    // Print the stack (linked list)

    printf("Stack: ");

    printList(head);

​

    // Free the memory allocated for the linked list

    freeList(head);

​

    return 0;

}