Why Linked List Exists and What Problem It Solves in DSA C - See It Work

Why Linked List Exists and What Problem It Solves

📖 Scenario: Imagine you have a row of boxes where you keep your favorite toys. Sometimes you want to add a new toy in the middle or remove one without moving all the others. Using a linked list is like having a chain of boxes where each box knows where the next one is, so you can easily add or remove toys without shifting everything.

🎯 Goal: You will create a simple linked list of toy names to understand why linked lists are useful. You will see how adding toys one by one works and how the list looks after adding them.

📋 What You'll Learn

Create a linked list node structure with a toy name and a pointer to the next node

Create the first node with the toy name "Car"

Add two more nodes with toy names "Doll" and "Ball" linked together

Print the linked list to show the order of toys

💡 Why This Matters

🌍 Real World

Linked lists are used in real life when you want to keep items in order but also want to add or remove items easily, like a playlist of songs or a chain of tasks.

💼 Career

Understanding linked lists is important for software developers because many programs use them to manage data efficiently, especially when the size of data changes often.

1

Create the first linked list node

Define a struct called Node with a char array toy[20] and a pointer next to Node. Then create a variable head of type Node* and allocate memory for it. Set head->toy to "Car" and head->next to NULL.

DSA C

#include 
#include 
#include 

// Define struct Node
// Create head node with toy "Car"
// Your code here

Hint

Use typedef struct Node to define the node. Use malloc to create the first node. Use strcpy to copy the toy name.

2

Add two more nodes to the linked list

Create two new nodes called second and third using malloc. Set their toy values to "Doll" and "Ball" respectively. Link head->next to second and second->next to third. Set third->next to NULL.

DSA C

#include 
#include 
#include 

typedef struct Node {
    char toy[20];
    struct Node* next;
} Node;

int main() {
    Node* head = (Node*)malloc(sizeof(Node));
    strcpy(head->toy, "Car");
    head->next = NULL;

    // Create second and third nodes and link them
    // Your code here

    return 0;
}

Hint

Use malloc to create new nodes. Use strcpy to set toy names. Link nodes by setting next pointers.

3

Traverse the linked list to print toy names

Create a pointer current and set it to head. Use a while loop to go through the list until current is NULL. Inside the loop, print the toy name in current->toy followed by " -> ". Move current to current->next.

DSA C

#include 
#include 
#include 

typedef struct Node {
    char toy[20];
    struct Node* next;
} Node;

int main() {
    Node* head = (Node*)malloc(sizeof(Node));
    strcpy(head->toy, "Car");
    head->next = NULL;

    Node* second = (Node*)malloc(sizeof(Node));
    strcpy(second->toy, "Doll");
    second->next = NULL;

    Node* third = (Node*)malloc(sizeof(Node));
    strcpy(third->toy, "Ball");
    third->next = NULL;

    head->next = second;
    second->next = third;

    // Traverse and print the list
    // Your code here

    return 0;
}

Hint

Use a while loop to move through the list. Print each toy name followed by an arrow. End with printing "NULL".

4

Print the final linked list output

Run the program to print the linked list showing the toys in order: "Car -> Doll -> Ball -> NULL".

DSA C

#include 
#include 
#include 

typedef struct Node {
    char toy[20];
    struct Node* next;
} Node;

int main() {
    Node* head = (Node*)malloc(sizeof(Node));
    strcpy(head->toy, "Car");
    head->next = NULL;

    Node* second = (Node*)malloc(sizeof(Node));
    strcpy(second->toy, "Doll");
    second->next = NULL;

    Node* third = (Node*)malloc(sizeof(Node));
    strcpy(third->toy, "Ball");
    third->next = NULL;

    head->next = second;
    second->next = third;

    Node* current = head;
    while (current != NULL) {
        printf("%s -> ", current->toy);
        current = current->next;
    }
    printf("NULL\n");

    // Run the program to see output
    // Your code here

    return 0;
}

Hint

Run the program and check the printed output matches the linked list order.