Write a c program to Create a single Linked list and perform Following Operations A. Insertion At Beginning B. Insertion At End C. Insertion After a particular node D. Insertion Before a particular node E. Insertion at specific position F. Search a particular node G. Return a particular node H. Deletion at the beginning I. Deletion at the end J. Deletion after a particular node K. Deletion before a particular node L. Delete a particular node M. Deletion at a specific position

  #include <stdio.h> #include <stdlib.h> // Define the structure for a node in the linked list struct Node { int data; struct Node* next; }; // Function to create a new node struct Node* createNode(int data) { struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); if (newNode == NULL) { printf("Memory allocation failed.\n"); exit(1); } newNode->data = data; newNode->next = NULL; return newNode; } // Function to insert a node at the beginning of the list int insertAtBeginning(struct Node** head, int data) { struct Node* newNode = createNode(data); newNode->next = *head; *head = newNode; } // Function to insert a node at the end of the list int insertAtEnd(struct Node** head, int data) { struct Node* newNode = createNode(data); if (*head == NULL) { *head = newNode; return 0; } struct Node* temp = *head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } // Function to insert a node after a particular node int insertAfterNode(struct Node* prevNode, int data) { if (prevNode == NULL) { printf("Previous node cannot be NULL.\n"); return 0; } struct Node* newNode = createNode(data); newNode->next = prevNode->next; prevNode->next = newNode; } // Function to insert a node before a particular node int insertBeforeNode(struct Node** head, struct Node* nextNode, int data) { if (nextNode == NULL) { printf("Next node cannot be NULL.\n"); return 0; } struct Node* newNode = createNode(data); if (*head == nextNode) { newNode->next = *head; *head = newNode; return 0; } struct Node* temp = *head; while (temp->next != nextNode) { temp = temp->next; } newNode->next = nextNode; temp->next = newNode; } // Function to insert a node at a specific position int insertAtPosition(struct Node** head, int position, int data) { if (position < 0) { printf("Invalid position.\n"); return 0; } if (position == 0) { insertAtBeginning(head, data); return 0; } struct Node* newNode = createNode(data); struct Node* temp = *head; for (int i = 0; i < position- 1 && temp != NULL; i++) { temp = temp->next; } if (temp == NULL) { printf("Position out of range.\n"); return 0; } newNode->next = temp->next; temp->next = newNode; } // Function to search for a particular node struct Node* searchNode(struct Node* head, int key) { while (head != NULL) { if (head->data == key) return head; head = head->next; } return NULL; } // Function to delete the first node int deleteAtBeginning(struct Node** head) { if (*head == NULL) { printf("List is empty, deletion not possible.\n"); return 0; } struct Node* temp = *head; *head = (*head)->next; free(temp); } // Function to delete the last node int deleteAtEnd(struct Node** head) { if (*head == NULL) { printf("List is empty, deletion not possible.\n"); return 0; } if ((*head)->next == NULL) { free(*head); *head = NULL; return 0; } struct Node* secondLast = *head; while (secondLast->next->next != NULL) { secondLast = secondLast->next; } free(secondLast->next); secondLast->next = NULL; } // Function to delete a node after a particular node int deleteAfterNode(struct Node* prevNode) { if (prevNode == NULL || prevNode->next == NULL) { printf("No node to delete.\n"); return 0; } struct Node* temp = prevNode->next; prevNode->next = temp->next; free(temp); } // Function to delete a node before a particular node int deleteBeforeNode(struct Node** head, struct Node* nextNode) { if (*head == NULL || *head == nextNode || (*head)->next == nextNode) { printf("No node to delete.\n"); return 0; } struct Node* temp = *head; while (temp->next->next != nextNode) { temp = temp->next; } struct Node* nodeToDelete = temp->next; temp->next = nextNode; free(nodeToDelete); } // Function to delete a particular node int deleteNode(struct Node** head, struct Node* keyNode) { if (*head == NULL) { printf("List is empty, deletion not possible.\n"); return 0; } if (*head == keyNode) { deleteAtBeginning(head); return 0; } struct Node* temp = *head; while (temp->next != keyNode) { temp = temp->next; if (temp == NULL) { printf("Node not found in the list.\n"); return 0; } } temp->next = keyNode->next; free(keyNode); } // Function to delete a node at a specific position int deleteAtPosition(struct Node** head, int position) { if (*head == NULL || position < 0) { printf("List is empty or position is invalid.\n"); return 0; } if (position == 0) { deleteAtBeginning(head); return 0; } struct Node* temp = *head; for (int i = 0; temp != NULL && i < position- 1; i++) { temp = temp->next; } if (temp == NULL || temp->next == NULL) { printf("Position out of range.\n"); return 0; } struct Node* nodeToDelete = temp->next; temp->next = nodeToDelete->next; free(nodeToDelete); } // Function to print the linked list int printList(struct Node* head) { while (head != NULL) { printf("%d ", head->data); head = head->next; } printf("\n"); } // Function to free the memory allocated to the linked list int freeList(struct Node** head) { struct Node* temp; while (*head != NULL) { temp = *head; *head = (*head)->next; free(temp); } } int main() { struct Node* head = NULL; insertAtBeginning(&head, 10); insertAtEnd(&head, 20); insertAtEnd(&head, 30); insertAtEnd(&head, 40); printf("Original List: "); printList(head); // Perform operations insertAtBeginning(&head, 5); printf("List after inserting at beginning: "); printList(head); insertAfterNode(head->next, 25); printf("List after inserting after a particular node: "); printList(head); insertBeforeNode(&head, head->next->next->next, 35); printf("List after inserting before a particular node: "); printList(head); insertAtPosition(&head, 2, 15); printf("List after inserting at specific position: "); printList(head); struct Node* searchedNode = searchNode(head, 30); if (searchedNode != NULL) printf("Node found: %d\n", searchedNode->data); else printf("Node not found.\n"); deleteAtBeginning(&head); printf("List after deletion at beginning: "); printList(head); deleteAtEnd(&head); printf("List after deletion at end: "); printList(head); deleteAfterNode(head->next); printf("List after deletion after a particular node: "); printList(head); deleteBeforeNode(&head, head->next->next); printf("List after deletion before a particular node: "); printList(head); deleteNode(&head, head->next); printf("List after deleting a particular node: "); printList(head); deleteAtPosition(&head, 2); printf("List after deletion at specific position: "); printList(head); // Free the memory allocated to the linked list freeList(&head); return 0; }