Link list

#include <iostream>
using namespace std;
class node{
  public:
  int data;
  node* next;
  
  node(int val){
      data=val;
      next=NULL;
  }
};

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

void display(node* head){
    node* temp=head;
    while(temp!=NULL){
        cout<<temp->data<<"->";
        temp=temp->next;
    }
    cout<<endl;
}
void DeleteAthead(node* &head){
    node* todelete=head;
    head=head->next;
    delete todelete;
}

void deletion(node* &head,int val){
    if(head==NULL) return;
    if(head->next==NULL){
        DeleteAthead(head);
    }
    node* temp=head;
    while(temp->next->data!=val){
        temp=temp->next;
    }
    node* todelete=temp->next;
    temp->next=temp->next->next;
    
    delete todelete;
}

int main() {
    node* head=NULL;
    InsertAtTail(head,1);
    InsertAtTail(head,2);
    InsertAtTail(head,3);
    InsertAtTail(head,4);
    display(head);
    DeleteAthead(head);
    display(head);
    deletion(head,3);
    display(head);
    return 0;
}