p

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

typedef struct node
{
    int val;
    struct node *next;
} node;

node *create(int data)
{
    struct node *new_node = (node *)malloc(sizeof(node));
    new_node->val = data;
    new_node->next = NULL;

    return new_node;
}
void print_list(node *head)
{
    node *current = head;

    while (current != NULL)
    {
        printf("%d \n", current->val);
        current = current->next;
    }
}
// add to the end
void push(node *head, int val)
{
    node *current = head;
    while (current->next != NULL)
    {
        current = current->next;
    }
    current->next = (node *)malloc(sizeof(node));
    current->next->val = val;
    current->next->next = NULL;
}

node *insertFront(node *head, int data)
{
    node *new_node = create(data);
    new_node->next = head;

    // return the new node as new head of list
    return new_node;
}

int pop(node *head, int val)
{
    int retval = -1;
    if (head == NULL)
    {
        return retval;
    }
    retval = head->val;
    node *next_node = head->next;
    head->val = next_node->val;
    head->next = next_node->next;

    return retval;
}
int main()
{
    node *head = NULL;
    head = (node *)malloc(sizeof(node));
    head->val = 1;
    head->next = NULL;

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

    return 0;
}