deletion_from_end_singly_linked_list.c

#include<iostream>
using namespace std;
struct node{
    int data;
    struct node *ptr;

};

struct node *head =NULL;

void insert_head(int a){
node *temp=new node;
temp->data=a;
temp->ptr=head;
head=temp;
}    

void deletion(){
    node *p=head, *pre;
    if(head==NULL){
        cout<<"Empty";
    }
    else{
    while(p->ptr!=NULL){
        pre=p;
        p=p->ptr;
    }
    if(head==p){
        head=NULL;
    }
    else{
        pre->ptr=NULL;
    }
    }
    
}

void display(){
if(head){
    node *p=head;
    while(p!=NULL){
        cout<<"Data is :"<<p->data<<endl;
        p=p->ptr;
    }
}
else 
cout<<"Empty Linked List";
}
int main(){
int a,b,c,d;
cout<<"Enter the data you want to insert: \n";
cin>>a>>b>>c>>d;
insert_head(a);
insert_head(b);
insert_head(c);
insert_head(d);
display();
deletion();
deletion();
 deletion();
deletion();
display();
return 0;
}