How to make a linked list in c?

Creating a Linked List in C: A Comprehensive Guide

Introduction

A linked list is a data structure in which elements are stored in separate objects, called nodes, linked together by pointers. This structure allows for efficient insertion and deletion of elements at any position in the list. In this article, we will explore how to create a linked list in C, including the basic components, common operations, and implementation details.

Basic Components of a Linked List

Before we dive into the implementation, let’s cover the basic components of a linked list:

• Node: A single element in the linked list, which contains a value and a pointer to the next node.
• Head: The first node in the linked list, which points to the next node.
• Tail: The last node in the linked list, which points to NULL.

Creating a Linked List in C

Here’s a step-by-step guide to creating a linked list in C:

Step 1: Define the Node Structure

// node.h

#ifndef NODE_H

#define NODE_H



typedef struct Node {

    int value;

    struct Node* next;

} Node;



#endif

Step 2: Define the Linked List Structure

// linked_list.h

#ifndef LINKED_LIST_H

#define LINKED_LIST_H



typedef struct LinkedList {

    Node* head;

    Node* tail;

    int size;

} LinkedList;



#endif

Step 3: Implement the Linked List Functions

// linked_list.c

#include <stdio.h>

#include <stdlib.h>

#include "node.h"

#include "linked_list.h"



// Function to create a new node

Node* createNode(int value) {

    Node* newNode = (Node*)malloc(sizeof(Node));

    if (!newNode) {

        printf("Memory errorn");

        return NULL;

    }

    newNode->value = value;

    newNode->next = NULL;

    return newNode;

}



// Function to add a new node at the end of the linked list

void addNode(LinkedList* list, int value) {

    Node* newNode = createNode(value);

    if (list->tail == NULL) {

        list->head = newNode;

        list->tail = newNode;

    } else {

        list->tail->next = newNode;

        list->tail = newNode;

    }

    list->size++;

}



// Function to print the linked list

void printList(LinkedList* list) {

    Node* current = list->head;

    while (current != NULL) {

        printf("%d -> ", current->value);

        current = current->next;

    }

    printf("NULLn");

}



// Function to delete a node from the linked list

void deleteNode(LinkedList* list, int value) {

    if (list->head == NULL) {

        printf("List is emptyn");

        return;

    }



    if (list->head->value == value) {

        Node* temp = list->head;

        list->head = list->head->next;

        free(temp);

        list->size--;

        return;

    }



    Node* current = list->head;

    while (current->next != NULL) {

        if (current->next->value == value) {

            Node* temp = current->next;

            current->next = current->next->next;

            free(temp);

            list->size--;

            return;

        }

        current = current->next;

    }

}



// Function to get the size of the linked list

int getSize(LinkedList* list) {

    return list->size;

}

Step 4: Create a Linked List and Test It

// main.c

#include <stdio.h>

#include "linked_list.h"



int main() {

    LinkedList list;

    list.head = NULL;

    list.tail = NULL;

    list.size = 0;



    addNode(&list, 1);

    addNode(&list, 2);

    addNode(&list, 3);

    addNode(&list, 4);

    addNode(&list, 5);



    printf("Linked List: ");

    printList(&list);



    deleteNode(&list, 3);

    printf("Linked List after deletion: ");

    printList(&list);



    printf("Size of the linked list: %dn", getSize(&list));



    return 0;

}

Common Operations

Here are some common operations you can perform on a linked list:

• Insertion: Add a new node at the end of the linked list.
• Deletion: Delete a node from the linked list.
• Search: Search for a specific node in the linked list.
• Traversal: Traverse the linked list and print the values of all nodes.

Implementation Details

Here are some implementation details you should know:

• Node Structure: The node structure consists of a value field to store the value of the node and a next field to point to the next node in the list.
• Linked List Structure: The linked list structure consists of a head field to point to the first node in the list and a tail field to point to the last node in the list.
• Size: The size of the linked list is the number of nodes in the list.
• Memory Management: The linked list uses dynamic memory allocation to create new nodes and manage memory.

Conclusion

Creating a linked list in C is a straightforward process that involves defining the basic components, implementing the linked list functions, and testing the implementation. By understanding the implementation details and common operations, you can create efficient and effective linked lists for various applications.