// Data Structures : Simple Linked List // Lang : C++ #include using namespace std; struct mylist{ public: int x; mylist *term; }; void traverse(mylist *nxt){ static int i=1; cout<<"Enter Element No."<>nxt->x; nxt->term=nullptr; if(nxt->x == 0) return; i++; nxt->term=new mylist; traverse(nxt->term); } void look(mylist *lst,int el){ if(lst->x==el){ mylist *edit=new mylist; edit->term=lst->term; lst->term=edit; cout<<"Enter Element To Place: "; cin>>edit->x; return; } else if(lst->term==nullptr) cout<<"No Element Found\n"; else look(lst->term,el); } void edit(mylist *lst){ int el; cout<<"Enter Element to Search: "; cin>>el; if(lst->x==el){ mylist *edit=new mylist; edit->term=lst->term; lst->term=edit; cout<<"Enter Element To Place: "; cin>>edit->x; return; } else look(lst->term,el); } void display(mylist *nxt){ static int i=1; if(nxt->term==NULL) return; cout<<"Term "<x<<"\n"; i++; display(nxt->term); } void look_del(mylist *lst,int el){ mylist *tmp; if(lst->x==el){ tmp=lst->term; delete lst; lst=tmp; } else if(lst->term==nullptr) cout<<"No Element Found\n"; else { look_del(lst->term,el); } } void del(mylist *lst){ int el; cout<<"Enter Element to Delete: "; cin>>el; if(lst->term==nullptr){ cout<<"List Is Being Empty Now"; delete lst; } else if(lst->x==el){ mylist *tmp; tmp=lst->term; delete lst; lst=tmp; } else { look_del(lst->term,el); } } int main() { mylist *lst=nullptr; lst=new mylist; cout<<"-----------------Enter Element------------------------\n"; traverse(lst); cout<<"-----------------Display Element------------------------\n"; display(lst); cout<<"-----------------Edit Element------------------------\n"; edit(lst); cout<<"-----------------Display Again------------------------\n"; display(lst); cout<<"-----------------Delete Element------------------------\n"; del(lst); cout<<"-----------------Display Again------------------------\n"; display(lst); return 0; }