singly_linked_list.c

linked lists Implementation

88 lines
1879 bytes
C
1// Singly Linked List - Complete Implementation
2#include <stdio.h>
3#include <stdlib.h>
4
5struct Node {
6    int data;
7    struct Node* next;
8};
9
10// Insert at beginning
11struct Node* insertAtBeginning(struct Node* head, int data) {
12    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
13    newNode->data = data;
14    newNode->next = head;
15    return newNode;
16}
17
18// Insert at end
19struct Node* insertAtEnd(struct Node* head, int data) {
20    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
21    newNode->data = data;
22    newNode->next = NULL;
23    
24    if (head == NULL) {
25        return newNode;
26    }
27    
28    struct Node* temp = head;
29    while (temp->next != NULL) {
30        temp = temp->next;
31    }
32    temp->next = newNode;
33    return head;
34}
35
36// Delete node
37struct Node* deleteNode(struct Node* head, int key) {
38    if (head == NULL) return NULL;
39    
40    if (head->data == key) {
41        struct Node* temp = head;
42        head = head->next;
43        free(temp);
44        return head;
45    }
46    
47    struct Node* temp = head;
48    while (temp->next != NULL && temp->next->data != key) {
49        temp = temp->next;
50    }
51    
52    if (temp->next != NULL) {
53        struct Node* toDelete = temp->next;
54        temp->next = temp->next->next;
55        free(toDelete);
56    }
57    
58    return head;
59}
60
61// Display list
62void display(struct Node* head) {
63    struct Node* temp = head;
64    while (temp != NULL) {
65        printf("%d -> ", temp->data);
66        temp = temp->next;
67    }
68    printf("NULL\n");
69}
70
71int main() {
72    struct Node* head = NULL;
73    
74    head = insertAtEnd(head, 10);
75    head = insertAtEnd(head, 20);
76    head = insertAtEnd(head, 30);
77    head = insertAtBeginning(head, 5);
78    
79    printf("Linked List: ");
80    display(head);
81    
82    head = deleteNode(head, 20);
83    printf("After deleting 20: ");
84    display(head);
85    
86    return 0;
87}
88