Merge pull request #10 from AbhiiVops/main

Added code for Linked List Insertion and Deletion In C

Author: gantavyamalviya

C Project/LinkedList/14_LinkedListTraversal.c

@@ -0,0 +1,55 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+struct  Node
+{
+     int data;
+     struct Node *next;
+    
+};
+
+void linkedListTraversal(struct Node* ptr)  {    //  ham ek head node naam ka pointer lenge jo head ko point krega
+                                                 // (head will be passed in argument from the main function at 
+                                                 //  the time of the function call)     
+
+    while(ptr != NULL) 
+    {
+    printf("Element : %d\n",ptr->data);   // ye intially pointer ke data ko print krega
+    ptr = ptr->next;    // aur ye pointer ke data ko update krega next data m
+    }
+  
+    }
+int main() {
+
+    struct Node * head;
+    struct Node * second;
+    struct Node * third;
+    struct Node * fourth;
+
+    // Allocate memory for nodes in the linked list in Heap
+    head = (struct Node*)malloc(sizeof(struct Node));
+    second = (struct Node*)malloc(sizeof(struct Node));
+    third = (struct Node*)malloc(sizeof(struct Node));
+    fourth = (struct Node*)malloc(sizeof(struct Node));
+
+     // Link first and second nodes
+    head->data = 7;
+    head->next = second;
+
+    // Link second and third node
+    second->data =11;
+    second->next = third;
+
+    // Link third and fourth node
+    third->data = 66;
+    third->next = fourth;
+
+    // Terminate the list at the fourth node
+    fourth-> data= 82;
+    fourth->next = NULL;
+
+    linkedListTraversal(head);
+
+    return 0;
+
+}

C Project/LinkedList/15_Linked_List_InsertAtFirst.c

@@ -0,0 +1,66 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+struct  Node
+{
+     int data;
+     struct Node *next;
+    
+};
+
+void linkedListTraversal(struct Node* ptr)  {  // pointer for traversal in Linked list
+
+    while(ptr != NULL) {
+    printf("Element : %d\n",ptr->data);
+    ptr = ptr->next;
+
+    }
+  
+    }
+
+ struct Node *insertAtFirst(struct Node *head,int data) {
+     struct Node * ptr = (struct Node*)malloc(sizeof(struct Node));
+     ptr-> next = head;
+     ptr -> data = data;
+     head =ptr;
+     return head;
+ }    
+
+
+int main() {
+
+    struct Node * head;
+    struct Node * second;
+    struct Node * third;
+    struct Node * fourth;
+
+    // Allocate memeory for nodes in the linked list in Heap
+    head = (struct Node*)malloc(sizeof(struct Node));
+    second = (struct Node*)malloc(sizeof(struct Node));
+    third = (struct Node*)malloc(sizeof(struct Node));
+    fourth = (struct Node*)malloc(sizeof(struct Node));
+
+     // Link first and third nodes
+    head->data = 7;
+    head->next = second;
+
+    // Link second and third node
+    second->data =11;
+    second->next = third;
+
+    // Link third and fourth node
+    third->data = 66;
+    third->next = fourth;
+
+    // Terminate the list at the fourth node
+    fourth-> data= 82;
+    fourth->next = NULL;
+
+    linkedListTraversal(head);
+    head = insertAtFirst(head,56);
+    printf("\n")
+;    linkedListTraversal(head);
+
+    return 0;
+
+}

C Project/LinkedList/LinkedListDeletion/Delete_A_Node.c

@@ -0,0 +1,88 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+
+struct Node {
+
+    int data;
+    struct Node * next;
+};
+
+void LinkedListTraversal(struct Node* ptr) {
+       
+       while(ptr!=NULL) {
+
+        printf("Element: %d\n",ptr->data);
+        ptr = ptr->next;
+       }
+
+}
+
+  struct Node * DeleteAfterNode(struct Node * head,int value) {
+      
+
+      struct Node * ptr = (struct Node *)malloc (sizeof(struct Node));
+      ptr = head; 
+
+       struct Node * q= (struct Node *)malloc (sizeof(struct Node));
+       q = ptr->next;
+      
+      while(q->data != value && q->next !=NULL) {
+        ptr = ptr-> next;
+        q = ptr ->next;
+        
+      }
+
+      if(q->data == value) {
+         ptr->next = q->next;
+         free(q);
+      }
+       
+       
+       
+
+     return head;
+
+  }
+
+int main(){
+
+    struct Node * head;
+    struct Node * second;
+    struct Node * third;
+    struct Node * fourth;
+
+
+    // Allocate memory dynamically to these pointers in the heap
+    head = (struct Node *)malloc(sizeof(struct Node));
+    second = (struct Node *)malloc(sizeof(struct Node));
+    third = (struct Node *)malloc(sizeof(struct Node));
+    fourth = (struct Node *)malloc(sizeof(struct Node));
+
+   
+     // Link first and second nodes
+    head->data = 7;
+    head->next = second;
+
+    // Link second and third node
+    second->data =11;
+    second->next = third;
+
+    // Link third and fourth node
+    third->data = 66;
+    third->next = fourth;
+
+    // Terminate the list at the fourth node
+    fourth-> data= 82;
+    fourth->next = NULL;
+
+    printf("Linked List Before deletion\n");
+    LinkedListTraversal(head);
+    head = DeleteAfterNode(head,99);
+    printf("Linked List After deletion\n");
+    LinkedListTraversal(head);
+
+
+    
+    return 0;
+}

C Project/LinkedList/LinkedListDeletion/Delete_First.c

@@ -0,0 +1,73 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+
+struct Node {
+
+    int data;
+    struct Node * next;
+};
+
+void LinkedListTraversal(struct Node* ptr) {
+       
+       while(ptr!=NULL) {
+
+        printf("Element: %d\n",ptr->data);
+        ptr = ptr->next;
+       }
+
+}
+
+  struct Node * DeleteFirst(struct Node * head) {
+      
+
+      struct Node * ptr = (struct Node *)malloc (sizeof(struct Node));
+      ptr = head;
+     head = head->next;
+     free(ptr);
+
+     return head;
+
+  }
+
+int main(){
+
+    struct Node * head;
+    struct Node * second;
+    struct Node * third;
+    struct Node * fourth;
+
+
+    // Allocate memory dynamically to these pointers in the heap
+    head = (struct Node *)malloc(sizeof(struct Node));
+    second = (struct Node *)malloc(sizeof(struct Node));
+    third = (struct Node *)malloc(sizeof(struct Node));
+    fourth = (struct Node *)malloc(sizeof(struct Node));
+
+   
+     // Link first and second nodes
+    head->data = 7;
+    head->next = second;
+
+    // Link second and third node
+    second->data =11;
+    second->next = third;
+
+    // Link third and fourth node
+    third->data = 66;
+    third->next = fourth;
+
+    // Terminate the list at the fourth node
+    fourth-> data= 82;
+    fourth->next = NULL;
+
+    printf("Linked List Before deletion\n");
+    LinkedListTraversal(head);
+    head = DeleteFirst(head);
+    printf("Linked List After deletion\n");
+    LinkedListTraversal(head);
+
+
+    
+    return 0;
+}

C Project/LinkedList/LinkedListDeletion/Deleting_Last_Node.c

@@ -0,0 +1,87 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+
+struct Node {
+
+    int data;
+    struct Node * next;
+};
+
+void LinkedListTraversal(struct Node* ptr) {
+       
+       while(ptr!=NULL) {
+
+        printf("Element: %d\n",ptr->data);
+        ptr = ptr->next;
+       }
+
+}
+
+  struct Node * DeleteLastNode(struct Node * head) {
+      
+
+      struct Node * ptr = (struct Node *)malloc(sizeof(struct Node));
+      ptr = head; 
+
+      struct Node * q= (struct Node *)malloc(sizeof(struct Node));
+
+      q = ptr->next;
+
+        
+      
+   
+       
+       while(q->next != NULL) {
+        ptr = ptr->next;
+        q = ptr->next;
+      }
+
+      ptr->next = NULL;
+      free(q);
+
+     return head;
+
+  }
+
+int main(){
+
+    struct Node * head;
+    struct Node * second;
+    struct Node * third;
+    struct Node * fourth;
+
+
+    // Allocate memory dynamically to these pointers in the heap
+    head = (struct Node *)malloc(sizeof(struct Node));
+    second = (struct Node *)malloc(sizeof(struct Node));
+    third = (struct Node *)malloc(sizeof(struct Node));
+    fourth = (struct Node *)malloc(sizeof(struct Node));
+
+   
+     // Link first and second nodes
+    head->data = 7;
+    head->next = second;
+
+    // Link second and third node
+    second->data =11;
+    second->next = third;
+
+    // Link third and fourth node
+    third->data = 66;
+    third->next = fourth;
+
+    // Terminate the list at the fourth node
+    fourth-> data= 82;
+    fourth->next = NULL;
+
+    printf("Linked List Before deletion\n");
+    LinkedListTraversal(head);
+    head = DeleteLastNode(head);
+    printf("Linked List After deletion\n");
+    LinkedListTraversal(head);
+
+
+    
+    return 0;
+}