#include using namespace std; struct node{ int val; node* next; node(int x): val(x),next(nullptr) {} node(int x, node* nxt): val(x),next(nxt){} }; class ReverseLinkedList{ public: void printLst(node* nnd){ while(nnd!=NULL){ cout<val<<"->"; nnd=nnd->next; } cout<<"NULL\n"; } node* reverse(node* head){ node* g=NULL, *h=new node(0); while(head!=NULL){ h=head->next; head->next=g; g=head; head=h; } return g; } int findMid(node* head){ node* one=head; node* two=head; while(two->next!=NULL && two->next->next!=NULL){ one=one->next; two=two->next->next; } return one->val; } node* merge(node* a, node* b){ node* ans=NULL; if (a==NULL) return b; else if(b==NULL) return a; else{ if(a->val<=b->val){ ans=a; ans->next=merge(a->next, b); } else{ ans=b; ans->next=merge(a,b->next); } } return ans; } node* delGivenNode(node* lst,node* givenNode){ if (givenNode->next!=NULL){ givenNode->val=givenNode->next->val; givenNode->next=givenNode->next->next; } else{ givenNode = NULL ; } return lst; } node* delNthFromLast(node* lst, int n){ node* strt=lst; node* end=lst; int i; for(i=0;i<=n;i++){ end=end->next; } while(end!=NULL){ strt=strt->next; end=end->next; } strt=strt->next; return delGivenNode (lst,strt); } }; int main() { node* n=new node(11); node* a=new node(9, n); node* b=new node(7, a); node* c=new node(5, b); node* d=new node(3, c); ReverseLinkedList R; node* cpy=d; R.printLst (cpy); int v=R.findMid(d); node* ans=R.reverse(d); node* aa=ans; cout<next->next->next->next); node* m1=m; R.printLst (m); node* y=R.delNthFromLast(m1,4); R.printLst (y); return 0; //https://leetcode.com/problems/reverse-linked-list/description/ }

reverse-findMid-merge2Sorted-delGivenNode-delNode'n'FromLast Linked List