Linked List 10 operations from which problems are made ( complete guide for you)
/* These are the functions we will implement make your seatbelts tight and start progrmming cout<<" 1. Insert node at begining"<<endl; cout<<" 2. Append a node"<<endl; cout<<" 3. display the l.l"<<endl; cout<<" 4. Insert before a selected node"<<endl; cout<<" 5. Insert after a selected node "<<endl; cout<<" 6.Delete a particular node"<<endl; cout<<" 7.Reverse A L.L "<<endl; cout<<" 8. Do bot reverse the l.l but display the reversed order (using recursion)"<<endl; cout<<"9. find middle element in a list using slow and fast pointer"<<endl; cout<<"10. check if linked list is palindrome or not (we know if even f=NULL odd f->next=NULL)"<<endl; cout<<" 11. exit"<<endl; */ #include<iostream> using namespace std; struct node{