Insert at End Tail Insert in DSA Go

Mental Model

Add a new item at the very end of a chain by moving to the last item and linking the new one after it.

Analogy: Imagine a line of people holding hands. To add a new person at the end, you walk to the last person and hold their hand.

head -> 1 -> 2 -> 3 -> null
           ↑

Dry Run Walkthrough

Input: list: 1 -> 2 -> 3, insert value 4 at end

Goal: Add the value 4 as the last item in the list

Step 1: start at head node with value 1

head -> [curr->1] -> 2 -> 3 -> null

Why: We begin from the start to find the last node

Step 2: move curr to next node with value 2

head -> 1 -> [curr->2] -> 3 -> null

Why: We keep moving forward to reach the end

Step 3: move curr to next node with value 3

head -> 1 -> 2 -> [curr->3] -> null

Why: We found the last node because next is null

Step 4: create new node with value 4 and link it after curr

head -> 1 -> 2 -> 3 -> 4 -> null

Why: Linking new node at the end completes insertion

Result:

head -> 1 -> 2 -> 3 -> 4 -> null

Annotated Code

DSA Go

package main

import "fmt"

type Node struct {
    val  int
    next *Node
}

type LinkedList struct {
    head *Node
}

func (ll *LinkedList) InsertAtEnd(value int) {
    newNode := &Node{val: value, next: nil}
    if ll.head == nil {
        ll.head = newNode
        return
    }
    curr := ll.head
    for curr.next != nil {
        curr = curr.next
    }
    curr.next = newNode
}

func (ll *LinkedList) PrintList() {
    curr := ll.head
    for curr != nil {
        fmt.Printf("%d -> ", curr.val)
        curr = curr.next
    }
    fmt.Println("null")
}

func main() {
    ll := LinkedList{}
    ll.InsertAtEnd(1)
    ll.InsertAtEnd(2)
    ll.InsertAtEnd(3)
    ll.InsertAtEnd(4)
    ll.PrintList()
}

if ll.head == nil { ll.head = newNode return }

handle empty list by setting head to new node

curr := ll.head

start traversal from head to find last node

for curr.next != nil { curr = curr.next }

move curr forward until last node (next is nil)

curr.next = newNode

link new node after last node to insert at end

Output

1 -> 2 -> 3 -> 4 -> null

Complexity Analysis

Time: O(n) because we traverse all nodes once to reach the end

Space: O(1) because we only create one new node and use constant extra space

vs Alternative: Compared to inserting at the head which is O(1), tail insert requires traversal making it O(n)

Edge Cases

empty list

new node becomes the head of the list

DSA Go

if ll.head == nil {
        ll.head = newNode
        return
    }

single element list

new node is linked after the single existing node

DSA Go

for curr.next != nil {
        curr = curr.next
    }

When to Use This Pattern

When you need to add an item at the end of a linked list, use tail insertion by traversing to the last node and linking the new node.

Common Mistakes

Mistake: Not checking if the list is empty before traversal
Fix: Add a condition to set head to new node if list is empty

Mistake: Linking new node before reaching the last node
Fix: Traverse until curr.next is nil before linking new node

Summary

Adds a new node at the end of a linked list by traversing to the last node and linking the new node.

Use when you want to keep the existing order and add new elements at the tail.

The key is to find the last node whose next pointer is null before inserting.

Practice

1. What does the "Insert at End (Tail Insert)" operation do in a singly linked list?

easy

A. Deletes the last node of the list

B. Adds a new node at the beginning of the list

C. Adds a new node at the end of the list

D. Deletes the first node of the list

Solution

1. Step 1: Understand the operation name

   "Insert at End" means adding a new element at the tail or last position of the list.

2. Step 2: Compare with other options

   Adding at the beginning is different, and deleting nodes is not insertion.

3. Final Answer:

   Adds a new node at the end of the list -> Option C

4. Quick Check:

   Insert at End = Add node at tail [OK]

Hint: Tail insert means add new node after last node [OK]

Common Mistakes:

• Confusing insert at end with insert at beginning
• Thinking it deletes nodes
• Assuming it inserts in the middle

2. Which of the following is the correct syntax to create a new node and insert it at the end in Go for a singly linked list?

easy

A. newNode := Node{value, nil}

B. newNode := &Node{data: value, next: nil}

C. newNode := &Node{value}

D. newNode := Node{data: value}

Solution

1. Step 1: Understand Go struct initialization

   In Go, to create a pointer to a struct with named fields, use &Node{field: value, ...}.

2. Step 2: Check each option

   newNode := &Node{data: value, next: nil} correctly uses &Node with named fields and sets next to nil for tail node.

3. Final Answer:

   newNode := &Node{data: value, next: nil} -> Option B

4. Quick Check:

   Pointer to struct with named fields = newNode := &Node{data: value, next: nil} [OK]

Hint: Use &Node{field: val, next: nil} to create tail node [OK]

Common Mistakes:

• Missing & to create pointer
• Not setting next to nil for tail
• Using unnamed fields incorrectly

3. What will be the printed linked list after inserting 4 at the end of the list 1 -> 2 -> 3 -> nil using tail insert?

medium

A. 1 -> 2 -> 3 -> 4 -> nil

B. 4 -> 1 -> 2 -> 3 -> nil

C. 1 -> 2 -> 4 -> 3 -> nil

D. 1 -> 2 -> 3 -> nil

Solution

1. Step 1: Understand tail insert effect

   Inserting 4 at the end adds it after 3, so list becomes 1 -> 2 -> 3 -> 4 -> nil.

2. Step 2: Compare options

   Only 1 -> 2 -> 3 -> 4 -> nil shows 4 at the end; others show wrong order or no change.

3. Final Answer:

   1 -> 2 -> 3 -> 4 -> nil -> Option A

4. Quick Check:

   Tail insert adds node at end [OK]

Hint: Tail insert appends new node after last node [OK]

Common Mistakes:

• Inserting at beginning instead of end
• Inserting in the middle
• Not updating last node's next pointer

4. Given the following Go code snippet for tail insertion, what is the error?

func InsertAtEnd(head *Node, value int) *Node {
    newNode := &Node{data: value, next: nil}
    if head == nil {
        head = newNode
    } else {
        temp := head
        for temp.next != nil {
            temp = temp.next
        }
        temp = newNode
    }
    return head
}

medium

A. temp = newNode does not link newNode to the list

B. head is not updated when list is empty

C. newNode is not created properly

D. Loop condition should be temp != nil

Solution

1. Step 1: Analyze the loop and insertion

   The loop finds the last node (temp.next == nil). Then temp = newNode only changes temp pointer, not the last node's next.

2. Step 2: Identify correct linking

   To insert, we must set temp.next = newNode, not temp = newNode.

3. Final Answer:

   temp = newNode does not link newNode to the list -> Option A

4. Quick Check:

   Link last node's next to newNode [OK]

Hint: Set lastNode.next = newNode, not lastNode = newNode [OK]

Common Mistakes:

• Assigning newNode to temp instead of temp.next
• Not handling empty list correctly
• Wrong loop condition

5. You have a singly linked list and want to insert multiple values [5, 10, 15] at the end one by one using tail insert. Which approach is most efficient?

hard

A. Traverse from head to end for each insertion

B. Create a new list for each value and merge later

C. Insert each new node at the beginning

D. Keep a tail pointer to last node and update it on each insert

Solution

1. Step 1: Understand repeated tail insert cost

   Traversing from head to end for each insert is costly (O(n) per insert), total O(n^2).

2. Step 2: Use tail pointer optimization

   Keeping a tail pointer allows direct access to last node, so insertion is O(1) each, total O(n).

3. Final Answer:

   Keep a tail pointer to last node and update it on each insert -> Option D

4. Quick Check:

   Tail pointer reduces insertion time [OK]

Hint: Use tail pointer to avoid full traversal each insert [OK]

Common Mistakes:

• Traversing full list every time
• Inserting at beginning instead of end
• Creating multiple lists unnecessarily