Why Linked List Exists and What Problem It Solves in DSA Go - Why It Works

Concept Flow - Why Linked List Exists and What Problem It Solves

Start: Need to store data

↓

Use Array?

Yes→Fixed size, fast access

No↓

Use Linked List

↓

Store nodes with data + pointer

↓

Add/Remove nodes easily without shifting

↓

Flexible size, dynamic memory use

↓

Problem solved: Efficient insert/delete without resizing

Shows decision between array and linked list, highlighting linked list's dynamic size and easy insert/delete.

Execution Sample

DSA Go

type Node struct {
  data int
  next *Node
}

// Linked list node with data and pointer to next node

Defines a linked list node storing data and a pointer to the next node.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Start with empty list	None	head = nil	null
2	Create node with data=10	Node(10)	head -> Node(10)	10 -> null
3	Create node with data=20	Node(10) -> Node(20)	Node(10).next -> Node(20)	10 -> 20 -> null
4	Insert node with data=15 between 10 and 20	Node(10) -> Node(15) -> Node(20)	Node(10).next -> Node(15), Node(15).next -> Node(20)	10 -> 15 -> 20 -> null
5	Remove node with data=15	Node(10) -> Node(20)	Node(10).next -> Node(20)	10 -> 20 -> null
6	Add node with data=25 at end	Node(10) -> Node(20) -> Node(25)	Node(20).next -> Node(25)	10 -> 20 -> 25 -> null
7	End of demo	Node(10) -> Node(20) -> Node(25)	No pointer changes	10 -> 20 -> 25 -> null

💡 Demonstrated dynamic insertions and deletions without shifting elements.

Variable Tracker

Variable	Start	After 2	After 3	After 4	After 5	After 6	Final
head	nil	Node(10)	Node(10)	Node(10)	Node(10)	Node(10)	Node(10)
Node(10).next	nil	nil	Node(20)	Node(15)	Node(20)	Node(20)	Node(20)
Node(15).next	nil	nil	nil	Node(20)	nil	nil	nil
Node(20).next	nil	nil	nil	nil	nil	Node(25)	Node(25)
Node(25).next	nil	nil	nil	nil	nil	nil	nil

Key Moments - 3 Insights

Why do we use pointers in linked lists instead of arrays?

Pointers let us link nodes dynamically without fixed size, as shown in steps 2-6 where nodes are connected by pointers, avoiding array resizing.

Why is insertion easier in linked lists compared to arrays?

Insertion only changes pointers (step 4), no shifting of elements needed, unlike arrays where elements must move.

What happens when we remove a node in a linked list?

We update pointers to skip the removed node (step 5), so the list stays connected without gaps.

Visual Quiz - 3 Questions

Look at the execution table, what is the visual state after step 4?

A 10 -> 15 -> 20 -> null

B 15 -> 10 -> 20 -> null

C 10 -> 20 -> null

D 10 -> null

💡 Hint

Check the 'Visual State' column at step 4 in the execution table.

At which step does the pointer Node(10).next change from Node(20) to Node(15)?

A Step 3

B Step 4

C Step 5

D Step 6

💡 Hint

Look at the 'Pointer Changes' column for Node(10).next in the execution table.

If we remove the node with data=15 at step 5, what happens to Node(10).next?

A It points to Node(15)

B It becomes nil

C It points to Node(20)

D It points to Node(25)

💡 Hint

Refer to step 5 in the execution table under 'Pointer Changes'.

Concept Snapshot

Linked List stores data in nodes linked by pointers.
Unlike arrays, it grows dynamically without resizing.
Insertion/deletion changes pointers, no shifting needed.
Good for unknown or changing data size.
Each node has data + pointer to next node.
Flexible and efficient for dynamic data.

Full Transcript

A linked list is a way to store data where each piece (node) holds data and a pointer to the next piece. Unlike arrays, linked lists do not need a fixed size and can grow or shrink easily. This is because adding or removing nodes only changes pointers, not the whole structure. The execution steps show starting with an empty list, adding nodes, inserting a node in the middle, removing a node, and adding at the end. This solves the problem of fixed size and costly shifting in arrays by using pointers to link nodes dynamically.

Practice

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

easy

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

B. Because linked lists use less memory than arrays always

C. Because linked lists provide faster access to elements by index

D. Because linked lists store elements in contiguous memory locations

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 advantages

   Linked lists store elements in nodes linked 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 A

4. Quick Check:

   Insertion/deletion ease = C [OK]

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

Common Mistakes:

• Thinking linked lists always use less memory
• Believing linked lists have faster index access
• Assuming linked lists store data contiguously

2. Which of the following is the correct way to declare a node struct for a singly linked list in Go?

easy

A. type Node struct { data int; next **Node }

B. type Node struct { data int; next Node }

C. type Node struct { data *int; next *Node }

D. type Node struct { data int; next *Node }

Solution

1. Step 1: Understand pointer usage in Go structs

   For linked lists, the next field must be a pointer to the next node to avoid copying the whole struct.

2. Step 2: Check each option

   type Node struct { data int; next *Node } uses *Node pointer correctly; B uses Node (value) which causes copying; C uses *int for data which is unnecessary; D uses **Node which is double pointer and unnecessary.

3. Final Answer:

   type Node struct { data int; next *Node } -> Option D

4. Quick Check:

   Next pointer = *Node [OK]

Hint: Next node must be a pointer to avoid copying [OK]

Common Mistakes:

• Using value type instead of pointer for next
• Using pointer for data unnecessarily
• Using double pointer for next

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

type Node struct {
    data int
    next *Node
}

func main() {
    head := &Node{data: 1}
    second := &Node{data: 2}
    third := &Node{data: 3}
    head.next = second
    second.next = third

    current := head
    for current != nil {
        fmt.Print(current.data, " -> ")
        current = current.next
    }
    fmt.Print("null")
}

medium

A. 3 -> 2 -> 1 -> null

B. 1 -> 2 -> 3 -> null

C. 1 -> 2 -> null

D. Compilation error

Solution

1. Step 1: Trace linked list creation

   Nodes created with data 1, 2, 3 linked in order: head -> second -> third.

2. Step 2: Trace printing loop

   Loop prints data of current node then moves to next until nil, so prints 1, 2, 3 in order, then prints "null".

3. Final Answer:

   1 -> 2 -> 3 -> null -> Option B

4. Quick Check:

   Print order matches linked list order [OK]

Hint: Follow next pointers to print nodes in order [OK]

Common Mistakes:

• Confusing order of nodes
• Forgetting to print null at end
• Assuming reverse order

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

type Node struct {
    data int
    next *Node
}

func main() {
    head := &Node{data: 1}
    second := &Node{data: 2}
    head.next = second

    newNode := &Node{data: 4}
    newNode.next = head.next
    head = newNode
}

medium

A. No bug; code works correctly

B. The newNode.next should be nil

C. The new node is not linked correctly; head pointer is overwritten

D. The second node is lost because head.next is nil

Solution

1. Step 1: Understand intended insertion

   The goal is to insert newNode after head, so newNode.next should point to head.next, then head.next should point to newNode.

2. Step 2: Identify bug in code

   The code sets newNode.next = head.next correctly but then overwrites head pointer itself with newNode, losing original head node and breaking list.

3. Final Answer:

   The new node is not linked correctly; head pointer is overwritten -> Option C

4. Quick Check:

   Head pointer changed incorrectly = D [OK]

Hint: Insert by changing next pointers, not head itself [OK]

Common Mistakes:

• Overwriting head instead of head.next
• Not linking newNode.next properly
• Assuming newNode.next should be nil

5. You want to implement a playlist where songs can be added or removed anywhere efficiently. 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 linked lists provide faster random access to songs by index

C. Because arrays automatically resize without overhead

D. Because linked lists store all songs contiguously in memory

Solution

1. Step 1: Understand playlist operations

   Adding/removing songs anywhere means frequent insertions and deletions at arbitrary positions.

2. Step 2: Compare array and linked list

   Arrays require shifting elements on insert/delete, which is slow. Linked lists use pointers to insert/delete nodes efficiently without shifting.

3. Final Answer:

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

4. Quick Check:

   Efficient insert/delete = A [OK]

Hint: Linked lists excel at dynamic insertions/removals [OK]

Common Mistakes:

• Thinking linked lists have faster random access
• Assuming arrays resize without cost
• Believing linked lists store data contiguously