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 collection of books that you want to organize on a shelf. Sometimes you want to add a new book in the middle without moving all the other books. Using a simple list means moving many books to make space, which is slow and tiring. A linked list is like a chain where each book holds a note pointing to the next book, so you can add or remove books easily without shifting others.

🎯 Goal: You will create a simple linked list of book titles to understand how linked lists help add and remove items efficiently compared to regular lists.

📋 What You'll Learn

Create a linked list node class called BookNode with a Title string and a Next pointer

Create a linked list by connecting BookNode objects

Add a new book node in the middle of the list

Print the linked list to show the order of books

💡 Why This Matters

🌍 Real World

Linked lists are used in real life when you want to keep items in order but need to add or remove items quickly, like managing playlists, undo history in apps, or organizing tasks.

💼 Career

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

1

Create the BookNode class

Create a class called BookNode with a public string property Title and a public BookNode property Next. Then create three BookNode objects with titles "Book A", "Book B", and "Book C".

DSA C#

// Define BookNode class and create three nodes
// Your code here

Hint

Define a class with two properties: Title for the book name and Next to point to the next book. Then create three instances with the given titles.

2

Link the BookNode objects

Connect the three BookNode objects by setting bookA.Next to bookB and bookB.Next to bookC to form a linked list.

DSA C#

public class BookNode
{
    public string Title { get; set; }
    public BookNode Next { get; set; }

    public BookNode(string title)
    {
        Title = title;
        Next = null;
    }
}

BookNode bookA = new BookNode("Book A");
BookNode bookB = new BookNode("Book B");
BookNode bookC = new BookNode("Book C");

// Link the nodes to form the list
// Your code here

Hint

Set the Next property of bookA to bookB and bookB to bookC to chain the books.

3

Insert a new book in the middle

Create a new BookNode called bookX with title "Book X". Insert bookX between bookA and bookB by updating the Next pointers accordingly.

DSA C#

public class BookNode
{
    public string Title { get; set; }
    public BookNode Next { get; set; }

    public BookNode(string title)
    {
        Title = title;
        Next = null;
    }
}

BookNode bookA = new BookNode("Book A");
BookNode bookB = new BookNode("Book B");
BookNode bookC = new BookNode("Book C");

bookA.Next = bookB;
bookB.Next = bookC;

// Create bookX and insert it between bookA and bookB
// Your code here

Hint

Create bookX and set its Next to bookB. Then update bookA.Next to bookX to insert it in the chain.

4

Print the linked list of books

Write a BookNode variable called current starting at bookA. Use a while loop to print each book's Title followed by " -> " until current is null. After the loop, print "null" to show the end of the list.

DSA C#

public class BookNode
{
    public string Title { get; set; }
    public BookNode Next { get; set; }

    public BookNode(string title)
    {
        Title = title;
        Next = null;
    }
}

BookNode bookA = new BookNode("Book A");
BookNode bookB = new BookNode("Book B");
BookNode bookC = new BookNode("Book C");

bookA.Next = bookB;
bookB.Next = bookC;

BookNode bookX = new BookNode("Book X");
bookX.Next = bookB;
bookA.Next = bookX;

// Print the linked list starting from bookA
// Your code here

Hint

Start from bookA and move through each Next node, printing the Title followed by " -> ". Stop when you reach the end (null) and print "null".

Practice

1. Why do we use a linked list instead of an array in some cases?

easy

A. Because linked lists are faster for accessing elements by index

B. Because linked lists allow easy insertion and deletion without shifting elements

C. Because linked lists store elements in contiguous memory locations

D. Because linked lists use less memory than arrays always

Solution

1. Step 1: Understand array limitations

   Arrays store elements in contiguous memory, so inserting or deleting elements requires shifting others, which is slow.

2. Step 2: Understand linked list advantage

   Linked lists store elements in nodes connected by pointers, so insertion and deletion can be done by changing pointers without shifting.

3. Final Answer:

   Because linked lists allow easy insertion and deletion without shifting elements -> Option B

4. Quick Check:

   Insertion/deletion ease = D [OK]

Hint: Linked lists excel at insert/delete without shifting [OK]

Common Mistakes:

• Thinking linked lists always use less memory
• Believing linked lists store elements contiguously
• Assuming linked lists have fast random access

2. Which of the following is the correct way to declare a node class for a singly linked list in C#?

easy

A. public class Node { int data; int next; }

B. class Node { public int data; public int next; }

C. public class Node { public int data; public Node next; }

D. public class Node { public int data; public Node previous; }

Solution

1. Step 1: Check node data types

   A node should store data and a reference to the next node, so data is int and next is Node type.

2. Step 2: Validate options

   public class Node { public int data; public Node next; } correctly declares data as int and next as Node. public class Node { int data; int next; } uses int for next which is wrong. class Node { public int data; public int next; } misses public for class and next is int. public class Node { public int data; public Node previous; } uses previous which is for doubly linked list, not singly.

3. Final Answer:

   public class Node { public int data; public Node next; } -> Option C

4. Quick Check:

   Node with int data and Node next = B [OK]

Hint: Node next must be Node type, not int [OK]

Common Mistakes:

• Using int type for next pointer
• Missing public access modifier
• Confusing singly and doubly linked list node

3. What will be the output of the following C# code that creates a linked list and prints its elements?

class Node {
  public int data;
  public Node next;
  public Node(int d) { data = d; next = null; }
}

class Program {
  static void Main() {
    Node head = new Node(10);
    head.next = new Node(20);
    head.next.next = new Node(30);

    Node current = head;
    while (current != null) {
      Console.Write(current.data + " -> ");
      current = current.next;
    }
    Console.WriteLine("null");
  }
}

medium

A. 10 -> 20 -> 30 -> null

B. 10 -> 20 -> null

C. 30 -> 20 -> 10 -> null

D. Compilation error

Solution

1. Step 1: Build linked list nodes

   Nodes created with data 10, 20, 30 linked in order: 10 -> 20 -> 30.

2. Step 2: Traverse and print nodes

   Loop prints each node's data followed by ' -> ', ending with 'null'. Output is 10 -> 20 -> 30 -> null.

3. Final Answer:

   10 -> 20 -> 30 -> null -> Option A

4. Quick Check:

   Traverse linked list prints nodes in order [OK]

Hint: Traverse from head, print data until null [OK]

Common Mistakes:

• Printing nodes in reverse order
• Missing last node in output
• Confusing next pointer usage

4. The following code tries to insert a new node with value 15 after the head node in a linked list. What is the error?

Node head = new Node(10);
head.next = new Node(20);
Node newNode = new Node(15);
newNode.next = head.next;
head.next = newNode.next;

medium

A. head should be null before insertion

B. newNode.next should be null

C. No error, code works fine

D. head.next is assigned incorrectly, losing the new node

Solution

1. Step 1: Analyze pointer assignments

   newNode.next is set to head.next (which is node with 20), correct for insertion.

2. Step 2: Check head.next assignment

   head.next is set to newNode.next, which points to node 20, so newNode is skipped and lost.

3. Final Answer:

   head.next is assigned incorrectly, losing the new node -> Option D

4. Quick Check:

   head.next must point to newNode, not newNode.next [OK]

Hint: head.next should point to newNode, not newNode.next [OK]

Common Mistakes:

• Assigning head.next to newNode.next instead of newNode
• Setting newNode.next to null incorrectly
• Not updating pointers in correct order

5. You want to implement a playlist where songs can be added or removed frequently at any position. Why is a linked list a better choice than an array for this use case?

hard

A. Because linked lists allow dynamic memory allocation and efficient insertions/removals anywhere

B. Because arrays automatically resize and are faster for insertions

C. Because linked lists store elements contiguously for faster access

D. Because arrays use pointers to link elements like linked lists

Solution

1. Step 1: Understand playlist operations

   Playlist requires frequent insertions and deletions at any position, which can be slow in arrays due to shifting.

2. Step 2: Compare data structures

   Linked lists allocate memory dynamically and allow changing pointers to insert or remove nodes efficiently without shifting elements.

3. Final Answer:

   Because linked lists allow dynamic memory allocation and efficient insertions/removals anywhere -> Option A

4. Quick Check:

   Dynamic insert/delete efficiency = A [OK]

Hint: Linked lists handle frequent insert/delete better than arrays [OK]

Common Mistakes:

• Thinking arrays resize automatically without cost
• Believing linked lists store elements contiguously
• Confusing arrays with pointer-based structures