// Data Structures : Doubly Linked List // Lang : C++ #include using namespace std; struct lst{ int data; lst *bck; lst *nxt; }; lst *input(lst *go){ cout<<"Enter Element: "; cin>>go->data; if(go->data!=0){ go->nxt=new lst; go->nxt->bck=go; go=input(go->nxt); } else{ go->nxt=nullptr; } return go; } void read(lst *go){ do{ cout<<"Current Element: "<data<nxt; }while(go->nxt); cout<<"--------------------Read Back-------------------------\n"; go=go->bck; do{ cout<<"Current Element (bck): "<data<bck; }while(go->bck); cout<<"Current Element (bck): "<data<nxt->data==el){ return go; } else if(go->nxt->nxt==nullptr) { return nullptr; } else { look(go->nxt,el); } } lst *del(lst *go){ int el; lst *tmp,*tp_f,*tp_b; cout<<"Enter Element To Search: "; cin>>el; if(go->data==el){ tmp=go->nxt; delete go; go=tmp; go->bck=nullptr; } else{ tp_f=look(go,el); if(tp_f==nullptr) cout<<"Element Not Found!!!"; else{ cout<<"Found tmp,tmp->nxt,tmp->nxt->nxt: "<data<<"\t"<nxt->data<<"\t"<nxt->nxt->data<<"\n"; tmp=tp_f->nxt->nxt; tmp->bck=tp_f; delete tp_f->nxt; tp_f->nxt=tmp; } } return go; } int main() { lst *top=new lst; top->bck=nullptr; cout<<"-------------------Input Straight---------------------\n"; input(top); cout<<"-----------------------Read---------------------------\n"; read(top); cout<<"--------------------Let's Delete----------------------\n"; top=del(top); cout<<"-----------------------Read---------------------------\n"; read(top); return 0; }