Create linked_list_insertion.cpp

This Algorithm has all the operations that can be performed on a linked list

Author: ijazzysharma

linked_list_insertion.cpp

@@ -0,0 +1,103 @@
+#include<iostream>
+using namespace std;
+class node{
+public:
+int data;
+node* next;
+node(int val){
+    data=val;
+    next=NULL;
+}
+};
+void insertAtTail(node* &head,int val){
+    node *n=new node(val);
+    if(head==NULL){
+    head=n;
+    return;
+    }
+    node*temp=head;
+    while(temp->next!=NULL){
+        temp=temp->next;
+    }
+    temp->next=n;
+}
+void insertAtHead(node* &head,int val){
+    node *n=new node(val);
+    n->next=head;
+    head=n;
+}
+bool search(node *head,int key){
+node *temp=head;
+while(temp!=NULL){
+    if(temp->data==key){
+        return true;
+    }
+    temp=temp->next;
+}
+return false;
+}
+void deleteAtHead(node* &head){
+    node *todelete=head;
+    head=head->next;
+    delete todelete;
+}
+void deletion(node* &head,int val){
+if(head==NULL){
+    return;
+}
+if(head->next==NULL){
+    deleteAtHead(head);
+}
+node *temp=head;
+while(temp->next->data!=val){
+    temp=temp->next;
+}
+node *todelete=temp->next;
+temp->next=temp->next->next;
+delete todelete;
+}
+node *reverse(node* &head){
+    node *prevptr=NULL;
+    node *currptr=head;
+    node * nextptr;
+    while(currptr!=NULL){
+        nextptr=currptr->next;
+        currptr->next=prevptr;
+        prevptr=currptr;
+        currptr=nextptr;
+    }
+    return prevptr;
+}
+node * reverseRecursive(node* &head){
+    if(head==NULL ||head->next==NULL){
+        return head;
+    }
+    node *newHead=reverseRecursive(head->next);
+    head->next->next=head;
+    head->next=NULL;
+    return newHead;
+}
+void display(node*head){
+    node *temp=head;
+    while(temp!=NULL){
+        cout<<temp->data<<"->";
+        temp=temp->next;
+    }cout<<"NULL"<<endl;
+}
+int main(){
+    node *head=NULL;
+    insertAtTail(head,1);
+    insertAtTail(head,2);
+    insertAtTail(head,3);
+    insertAtTail(head,4);
+    display(head);
+    insertAtHead(head,0);
+    display(head);
+    cout<<endl;
+    cout<<search(head,2)<<endl;
+    deletion(head,2);
+    display(head);
+    node * newhead=reverseRecursive(head);
+    display(newhead);
+    return 0;
+}