p6.cpp

#include <iostream>

using namespace std;


class node {
    public:
    int data;
    node* next;
    
    node(int value){
        data = value;
        next=NULL;
        
    }
};


node* insertAthead(node** head_ref, int val1){
    node*n1 = new node(val1);
    node* head;
    head = *head_ref;
    if(head==NULL){
        n1->next==NULL;
    }
    
    n1->next=head;
    head=n1;
    
    return head;
}


void insertAtend(node** head_ref, int val){
    node* n= new node(val);
    node* head;
    head = *head_ref;
    
    if(head==NULL){
        head=n;
        n->next=NULL;
        return;
    }
 
    
    node* temp;
    temp=head;
    
    while(temp->next!=NULL){
        temp=temp->next;
        
    }
    
    temp->next=n;
    n->next=NULL;
    
}


void deletion(node** head_ref, int val){
    node* head;
    head = *head_ref;
    node* temp;
    temp=head;
    node* todel;
    
    while(temp->next->data!=val){
        temp=temp->next;
    }
    
    todel=temp->next;
    temp->next = temp->next->next;
        
    delete todel;
}


void print(node* head){
    node* temp1;
    temp1=head;
    
    while(temp1!=NULL){
        cout<< temp1->data<<endl;
        temp1=temp1->next;
    }
    
}



int main()
{
    
    
    cout<<"Hello World";
    node* head;
    head = new node(10);
    node** head_ref1;
    head_ref1= &head;
    head=insertAthead(head_ref1, 40);
    insertAtend(head_ref1 , 20);
    insertAtend(head_ref1 , 30);
    deletion(head_ref1 , 20);
    
    print(head);
    



    return 0;
}