![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1688549456531-C%20Program%20For%20Insertion%20and%20Deletion%20in%20Linked%20List.jpg\")
<\/p>\n<\/p>\n
Linked lists are fundamental data structures used in computer science and programming to efficiently store and manipulate data. Their dynamic nature and flexibility make them an essential tool for various applications. One of the key operations performed on linked lists is the insertion and deletion of elements.<\/p>\n
In this article, we will delve into the world of linked lists and explore an efficient C program that demonstrates how to perform insertion and deletion operations. By understanding the concepts behind these operations and studying the implementation in C, readers will gain valuable insights into the power and versatility of linked lists.<\/p>\n
A linked list in C is a linear data structure consisting of nodes, where each node contains a data element and a reference (or pointer) to the next node in the list. Unlike arrays, linked lists do not require contiguous memory allocation, allowing for dynamic memory allocation during runtime.<\/p>\n
In the diagram above, each node contains two components: the data field, which stores the actual value or information, and the next field, which points to the next node in the list. The last node in the list has a "NULL" value in its next field, indicating the end of the list.<\/p>\n
By following the next pointers, we can traverse the linked list and access or modify its elements. This dynamic structure allows for efficient insertion and deletion operations at any position within the list, as nodes can be easily rearranged by updating the appropriate pointers.<\/p>\n
Before we delve into the code, let’s briefly recap the different types of insertions that can be performed in a linked list:<\/p>\n
Insertion at the Beginning:<\/strong> In this operation, a new node is added at the beginning of the list, and it becomes the new head of the list.<\/p>\n<\/li>\n Insertion at the End:<\/strong> Here, a new node is appended to the end of the list, becoming the new tail node.<\/p>\n<\/li>\n Insertion at a Specific Position:<\/strong> This operation involves adding a new node at a particular position within the list, shifting the existing nodes accordingly.<\/p>\n<\/li>\n<\/ul>\nInsertion at the Beginning:<\/h2>\n
void insertAtBeginning(struct Node** head, int value) {\n \/\/ Create a new node\n struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\n\n \/\/ Set the value of the new node\n newNode->data = value;\n\n \/\/ Point the new node to the current head\n newNode->next = *head;\n\n \/\/ Update the head to point to the new node\n *head = newNode;\n}<\/code><\/pre>\nInsertion at the End:<\/h2>\n
void insertAtEnd(struct Node** head, int value) {\n \/\/ Create a new node\n struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\n struct Node* temp = *head;\n\n \/\/ Set the value of the new node\n newNode->data = value;\n\n \/\/ Make the new node the tail\n newNode->next = NULL;\n\n \/\/ If the list is empty, make the new node the head\n if (*head == NULL) {\n *head = newNode;\n return;\n }\n\n \/\/ Traverse to the end of the list\n while (temp->next != NULL) {\n temp = temp->next;\n }\n\n \/\/ Append the new node at the end\n temp->next = newNode;\n}<\/code><\/pre>\nInsertion at a Specific Position:<\/h2>\n
void insertAtPosition(struct Node** head, int value, int position) {\n \/\/ Create a new node\n struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\n struct Node* temp = *head;\n\n \/\/ Set the value of the new node\n newNode->data = value;\n\n \/\/ Traverse to the desired position\n for (int i = 1; i < position - 1; i++) {\n if (temp->next != NULL) {\n temp = temp->next;\n } else {\n printf(\"Invalid position\\n\");\n return;\n }\n }\n\n \/\/ Insert the new node at the desired position\n newNode->next = temp->next;\t\t\t\t\t\t