Delete_node_header_file

Node *remove_node(Node *head, int item)
{
    Node *temp = head;
    if(temp->data == item)
    {
        head = temp->next;
        free(temp);
        return head;
    }

    // code is here means the node is not the first node

    Node *previous_node;
    while(temp != NULL)
    {
        if(temp->data == item)
        {
            break;
        }
        previous_node = temp;
        temp = previous_node->next;
    }
    if(temp == NULL)
    {
        return head;
    }
    previous_node->next = temp->next;
    free(temp);
    return head;
}