Linked List Programs in C

A linked list is a collection of objects called nodes that are stored in memory at random locations. Each node has two fields, one for storing data and the other for storing the address of the next node in memory. The head node contains the address of the first node and the last node of the linked list contains a pointer to the null. Linked list operations such as insert, delete, traverse, search, and sort allow to perform a wide range of operations on linked lists.

Types of Linked List:

There are three types of Linked List in C:

• Singly Linked List: Singly linked list is the most common linked list type. Each node stores data as well as a pointer to the next node.
• Doubly Linked List: A doubly linked list is created by adding pointers to the previous and next nodes.
• Circular Linked List: A circular linked list is a variation of a linked list in which the last element is linked to the first element.

Linked List Applications:

• Stacks and queues implementation
• Dynamic memory allocation
• Graphs implementation
• Representing sparse matrices
• Precision arithmetic

The following section contains various C programs about linked lists, linked list operations, singly-linked lists, doubly linked lists, and data structures using linked lists. It also includes different programs on a linked list using recursion. Each sample program on the linked list includes a program description, C code, and program output. All examples have been compiled and tested on Windows and Linux systems.

Here is the listing of C programming examples on Linked List:

1. C Programs on Linked List
2. C Programs on Linked List Operations
3. C Programs on Singly Linked List
4. C Programs on Doubly Linked List
5. C Programs on Data Structures using Linked List
6. C Programs on Interchange and Modify Operations
7. C Programs on Linked List using Recursion

/*
 * C program to create a linked list and display the elements in the list
 */
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
 
void main()
{
    struct node
    {
        int num;
        struct node *ptr;
    };
    typedef struct node NODE;
 
    NODE *head, *first, *temp = 0;
    int count = 0;
    int choice = 1;
    first = 0;
 
    while (choice)
    {
        head  = (NODE *)malloc(sizeof(NODE));
        printf("Enter the data item\n");
        scanf("%d", &head-> num);
        if (first != 0)
        {
            temp->ptr = head;
            temp = head;
        }
        else
        {
            first = temp = head;
        }
        fflush(stdin);
        printf("Do you want to continue(Type 0 or 1)?\n");
        scanf("%d", &choice);
 
    }
    temp->ptr = 0;
    /*  reset temp to the beginning */
    temp = first;
    printf("\n status of the linked list is\n");
    while (temp != 0)
    {
        printf("%d=>", temp->num);
        count++;
        temp = temp -> ptr;
    }
    printf("NULL\n");
    printf("No. of nodes in the list = %d\n", count);
}