node* remove_item(node *head, int num)
{
    // 1>3>5>6>NULL
    node *temp = head;
    node *delete_node;

    if(head == NULL)
        printf("\nList is empty!\n");

    else if(temp->value == num)
    {
        delete_node = temp;
        free(delete_node);
        head = temp->next;
        return head;
    }

    else
    {
        while(temp->next != NULL)
        {
            if(temp->next->value == num)
            {
                delete_node = temp->next;
                temp->next = temp->next->next;
                free(delete_node);
                return head;
            }
            temp = temp->next;
        }

        if(temp->next == NULL && temp->value != num)
        {
            printf("Didn't find!\n");
            return head;
        }
    }

    return head;
}




node* remove_last_item(node *head)
{
    // 1>3>5>6>NULL
    node *temp = head;
    node *delete_node;

    if(head == NULL)
        printf("\nList is empty!\n");

    else if(temp->next == NULL)
    {
        delete_node = temp;
        head = NULL;
        free(delete_node);
    }

    else
    {
        while(temp->next->next != NULL)
        {
            temp = temp->next;
        }

        delete_node = temp->next;
        temp->next = NULL;
        free(delete_node);
    }

    return head;
}