deletion of a node in a singly linked list

i have made a program in c++ to delete a node in a singly linked list but it is not working as predicted i am attaching pictures of the output for better clarity that whats misbehaving. code:

int del_node(int val_del)                     //this section is producing error
    {
        node* temp_del=head;
        if(head==nullptr)
        {
            cout<<"no element to delete.!";
            exit(0);
        }
        else
        {
            while(temp_del->next!=nullptr)
            {
                if(temp_del->next->data==val_del)
                {
                    temp_del->next=temp_del->next->next;
                    delete temp_del->next->next;
                }
             temp_del=temp_del->next;
            }

        }
        return 0;
    }

this a function of a class. here is the complete code if it helps:

#include<iostream>
using namespace std;

struct node
{
    int data;
    node *next;
};

class linked_list
{
    node *head,*tail;
public:
    linked_list()
    {
        head=nullptr;
        tail=nullptr;
    }
    int create_last(int val_last)
    {
        node *temp=new node; if(!temp){cout<<"memory not allocated";    exit(1);}
        temp->data=val_last;
        temp->next=nullptr;
        if(head==nullptr)
        {
            head=temp;
            tail=temp;
        }
        else
        {
            tail->next=temp;
            tail=temp;
        }
        return 0;
    }

    int create_beg(int val_beg)
    {
        node *temp_head=nullptr;
        node *temp=new node; if(!temp){cout<<"memory not allocated";    exit(1);}
        temp->data=val_beg;
        temp->next=nullptr;
        if(head==nullptr)
        {
            head=temp;
            tail=temp;
        }
        else
        {
            temp_head=head;
            head=temp;
            temp->next=temp_head;
        }
        return 0;
    }

    int del_node(int val_del)                     //this section is producing error
    {
        node* temp_del=head;
        if(head==nullptr)
        {
            cout<<"no element to delete.!";
            exit(0);
        }
        else
        {
            while(temp_del->next!=nullptr)
            {
                if(temp_del->next->data==val_del)
                {
                    temp_del->next=temp_del->next->next;
                    delete temp_del->next->next;
                }
             temp_del=temp_del->next;
            }

        }
        return 0;
    }


    int show()
    {
        node* temp_show=head;
        while(temp_show!=nullptr)
        {
            cout<<temp_show->data<<"\n";
            temp_show=temp_show->next;
        }
        return 0;
    }

}info;

int main()
{
    int choice,ele; char cont;
    rep:
    cout<<"1. Insert node at the end\n";
    cout<<"2. Insert node at beg\n";
    cout<<"3. Delete node\n";
    cout<<"4. Show nodes\n";
    cout<<"5. Exit\n";
    cout<<"enter your choice: ";
    cin>>choice;
    switch(choice)
    {
        case 1: cout<<"Enter element:  ";
                cin>>ele;
                info.create_last(ele);
                break;
        case 2: cout<<"Enter element:  ";
                cin>>ele;
                info.create_beg(ele);
                break;
        case 3: cout<<"Enter element:  ";
                cin>>ele;
                info.del_node(ele);
                break;
        case 4: info.show();
                break;
        case 5: exit(0);
                break;
        default: cout<<"Wrong choice, Bye.!!";
                 exit(0);
    }
    cout<<"Do you want to continue(y/n): ";
    cin>>cont;
    if(cont=='y'||cont=='Y')
    {
        goto rep;
    }
    else
    {
        cout<<"thank you";
        exit(0);
    }
    return 0;
}

output of the program.