Basic Code C++ : Linked List - Delete a node from any position

Your code should be based on my code and you only have to add the 'Delete from any postion function' #include <iostream> using namespace std; //Creating Node Structure struct Node{ int data; Node *link; }; // Creating Head Pointer and Equating to Null Node *head=NULL; //Function to insert at the beginning of linked list void insertBeg( int d){ Node *ptr= new Node(); ptr->data=d; ptr->link=head; head=ptr; } //Function to insert at the end of linked list void insertEnd(int d){ Node *ptr= new Node(); ptr->data=d; ptr->link=NULL; if(head==NULL){ head=ptr; else{ Node *temp= head; while (temp->link !=NULL){ temp=temp->link } temp->link=ptr; } void displayList(){ Node *ptr=head; if(head==NULL) cout<<"LIST IS EMPTY\n"; while(ptr!=NULL) { cout<<ptr->data<<" "; ptr=ptr->link; } cout<<"\n"; } int main() { insertEnd(1); insertEnd(2); insertEnd(3); insertEnd(4); insertEnd(5); displayList(); return0; }