#include using namespace std; struct node{ int data; node* next; }; struct node* head= NULL; void createnode(int data){ node* newnode = (struct node*)malloc(sizeof(struct node)); newnode->data= data; newnode->next= head; head = newnode; } void insertnode(int data, int pos){ struct node* temp= (struct node*)malloc(sizeof (struct node)); temp->data = data; temp-> next = NULL; int index=1;int size= 4; struct node* ptr= head; if(ptr == NULL ){ return; } else if ( ptr !=NULL){ if(pos<0||pos>size+1){ cout<<"invalid position"< next; index++; } temp->next= ptr->next; ptr->next = temp; } } void deletenode(int key){ struct node* temp=head; struct node* prev; if(temp!=NULL||temp->data==key){ head=temp->next; free(temp); } while(temp!=NULL||temp->data!=key){ prev=temp; temp=temp->next; } if(temp==NULL){ return; } prev->next = temp->next; free(temp); } void display( ){ struct node* ptr = head; while(ptr!= NULL){ cout<< "\n"<data; ptr=ptr->next; } } void reverse(){ struct node* current=head; struct node* next = NULL; struct node* prev= NULL; while(current!=NULL){ next=current->next; current->next=prev; prev=current; current=next; } current=next; } void middlenode(){ struct node* q ,p; p=head; q=head; while(head!=null){ p=p->next; q=q->next->next; head = head->next; } cout<<" the middlenode is"< data; } int main() { int a,b; createnode(3); createnode(4); createnode(6); createnode(8); display(); cout<<"enter the data and position of node u want to enter\n"; cin>>a>>b; insertnode(a,b); cout<<"linked list u create\n"<

insertion at any position u want