#include<iostream>

#include<conio.h>

using namespace std;

int choice,ci;

struct node

int data;

node *link;

};

node *end,*temp,*q;

void creat_node(void);

void insert_node(void);

void display_node(void);

void delete_node(void);

void update_node(void);

void search_node(void);

int main()

while(1)

cout<<"\n \n 1-creat-node\n 2-insert_node\n 3-delete_node\n 4-

update_node\n 5-search_node\n 6-display_node\n 7-count_node\n 8-exit\n "<<endl;

cout<<"Enter ur choice: ";

cin>>choice;
switch(choice)

case 1:

creat_node();

break;

case 2:

insert_node();

break;

case 3:

delete_node();

break;

case 4:

update_node();

break;

case 5:

search_node();

break;

case 6:

display_node();

break;

case 8:

default:

cout<<"Enter a valid option\n ";

}
 }

void creat_node()

temp=new node;

cout<<"Enter data in starting node: ";

cin>>temp->data;

end=temp;

end->link=end;

void insert_node() //insert node

temp=new node;

cout<<"Enter data in new node: ";

cin>>temp->data;

cout<<"1-Insert_at_start\n 2-Insert_at_mid\n 3-Insert_at_end\n ";

cin>>ci;

switch(ci)

case 1: //insert at start

temp->link=end->link;

end->link=temp;

break;

case 2: //insert at mid

 int pos,i;

cout<<"At which position u want enter";

cin>>pos;

q=end->link;

for(i=1;i<pos-1;i++)

q=q->link;

temp->link=q->link;

q->link=temp;

break;

case 3: //insert at
end

temp->link=end->link;

end->link=temp;

end=temp;

void display_node()

node *q;

q=end->link;

while(q!=end)

{
 cout<<q->data<<endl;

q=q->link;

cout<<q->data;

void delete_node()

node *p;

int delnode,pos,i;

cout<<"1-delete at start\n 2-delete at end \n 3-delete at mid\n";

cin>>delnode;

switch(delnode)

case 1: //delete at start

q=end->link;

end->link=q->link;

delete q;

case 2: //delete at end

q=end->link;

while(q->link!=end)

q=q->link;

q->link=end->link;
 delete end;

end=q;

case 3: //deletion at mid

p=q=end->link;

cout<<"At which position u want to enter ";

cin>>pos;

for(i=1;i<pos;i++)

p=q;

q=q->link;

p->link=q->link;

delete q;

break;

void update_node()

q=end->link;

int n,v,i;

cout<<"Enter node to be update: ";

cin>>n;

for(i=1;i<n;i++)

{
 q=q->link;

cout<<"Enter value to be update: ";

cin>>v;

q->data=v;

void search_node()

node *q;

int v,f=0,c=1;

q=end->link;

cout<<"Enter value to search\n";

cin>>v;

while(q!=end)

if(q->data==v)

f=1;

q=q->link;

c++;

if(f==0)

cout<<"not found";
 else

cout<<"found "<<endl;