Insert at End Tail Insert in DSA Python - Execution Trace

Concept Flow - Insert at End Tail Insert

Create new node with data

↓

Is list empty?

↓

Set head = new_node

↓

Traverse until current.next == None

↓

Set current.next = new_node

↓

Done

Create a new node, check if list is empty, if yes set head to new node; else traverse to last node and link new node at end.

Execution Sample

DSA Python

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None

    def insert_at_end(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        current = self.head
        while current.next:
            current = current.next
        current.next = new_node

# Insert 10, 20, 30

This code inserts nodes with values 10, 20, 30 at the end of a linked list.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Insert 10	None	head = new_node(10)	BEFORE: None AFTER: ┌────────┐ │ data:10│ │ next:∅ │ └────────┘ head → node(10)
2	Insert 20	10	current = head(10) current.next = new_node(20)	BEFORE: ┌────────┐ │ data:10│ │ next:∅ │ └────────┘ head → node(10) AFTER: ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ next:──┼──→ │ next:∅ │ └────────┘ └────────┘ head → node(10) → node(20)
3	Insert 30	10 → 20	current = head(10) → current = current.next(20) current.next = new_node(30)	BEFORE: ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ next:──┼──→ │ next:∅ │ └────────┘ └────────┘ head → node(10) → node(20) AFTER: ┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ next:──┼──→ │ next:──┼──→ │ next:∅ │ └────────┘ └────────┘ └────────┘ head → node(10) → node(20) → node(30)
4	End	10 → 20 → 30	No pointer changes	Final list: head → node(10) → node(20) → node(30)

💡 After inserting 30, current.next is None, so insertion ends.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	Final
head	None	node(10)	node(10)	node(10)	node(10)
current	None	None	node(10)	node(20)	node(20)
new_node	None	node(10)	node(20)	node(30)	node(30)

Key Moments - 3 Insights

Why do we check if head is None before traversing?

Because if the list is empty (head is None), we must set head to the new node directly. See execution_table Step 1 where head was None and set to new_node(10).

Why do we stop traversal when current.next is None, not current?

We stop at current.next == None because current is the last node. We want to link new_node to current.next. See execution_table Step 3 where traversal moves until current.next is None before insertion.

What happens to the new node's next pointer after insertion?

The new node's next pointer is always None (null) because it becomes the last node. This is shown in all AFTER visuals where new_node's next is ∅.

Visual Quiz - 3 Questions

Look at the execution_table at Step 2, what is the pointer change?

A head is set to new_node(20)

B current.next is set to new_node(20)

C current is set to new_node(20)

D head.next is set to new_node(10)

💡 Hint

Check the 'Pointer Changes' column in Step 2 of execution_table.

At which step does the list first have two nodes?

A Step 2

B Step 1

C Step 3

D Step 4

💡 Hint

Look at the 'Nodes in List' column in execution_table.

If we insert a new node with data 40 after Step 3, what will current be set to during traversal?

A head (node 10)

B node 20

C node 30

D None

💡 Hint

Traversal moves until current.next is None; after Step 3, node 30 is last.

Concept Snapshot

Insert at End (Tail Insert) in Linked List:
- Create new node with data
- If list empty (head is None), set head = new node
- Else traverse from head until last node (current.next == None)
- Set last node's next = new node
- New node's next = None (tail node)

Full Transcript

To insert at the end of a linked list, first create a new node with the given data. Check if the list is empty by seeing if head is None. If empty, set head to the new node. If not empty, start at head and move through nodes until you find the last node where next is None. Then set that last node's next pointer to the new node. The new node's next pointer is always None because it becomes the last node. This process is repeated for each insertion, growing the list at the tail.

Practice

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

easy

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

B. Removes the last node from the list

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

D. Deletes the first node of the list

Solution

1. Step 1: Understand the operation

   Insert at End means adding a new node after the last node in the list.

2. Step 2: Compare with other operations

   Other options describe removing or adding at the start, which is different.

3. Final Answer:

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

4. Quick Check:

   Insert at End = Add node at end [OK]

Hint: Tail insert always adds node after the last one [OK]

Common Mistakes:

• Confusing insert at end with insert at beginning
• Thinking it removes nodes instead of adding
• Mixing up head and tail operations

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

easy

A. new_node = Node(data); new_node.next = head; head = new_node

B. new_node = Node(data); tail = new_node; new_node.next = tail

C. new_node = Node(data); head.next = new_node; head = new_node

D. new_node = Node(data); tail.next = new_node; tail = new_node

Solution

1. Step 1: Create new node and link it after tail

   We create new_node and set tail.next to it, then update tail to new_node.

2. Step 2: Check other options for correctness

   new_node = Node(data); new_node.next = head; head = new_node inserts at head, C wrongly updates head, D sets tail before linking.

3. Final Answer:

   new_node = Node(data); tail.next = new_node; tail = new_node -> Option D

4. Quick Check:

   Tail.next = new_node, tail = new_node [OK]

Hint: Tail insert updates tail.next then tail pointer [OK]

Common Mistakes:

• Assigning new_node.next before linking to tail
• Updating head instead of tail
• Not updating tail pointer after insertion

3. What will be the output linked list after executing this code?

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

head = Node(1)
tail = head

for value in [2, 3, 4]:
    new_node = Node(value)
    tail.next = new_node
    tail = new_node

# Print list
current = head
result = []
while current:
    result.append(current.data)
    current = current.next
print(result)

medium

A. [1, 2, 3, 4]

B. [4, 3, 2, 1]

C. [1, 2, 3]

D. [2, 3, 4]

Solution

1. Step 1: Build linked list by tail insertion

   Start with head=1, then add 2, 3, 4 at tail in order.

2. Step 2: Traverse and collect node data

   Traverse from head, collect [1, 2, 3, 4] in order.

3. Final Answer:

   [1, 2, 3, 4] -> Option A

4. Quick Check:

   Tail insert preserves order [OK]

Hint: Tail insert keeps order same as input list [OK]

Common Mistakes:

• Confusing order and reversing list
• Printing only last inserted nodes
• Not updating tail pointer correctly

4. Identify the error in this tail insert code snippet:

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

head = Node(10)
tail = head

new_node = Node(20)
new_node.next = tail
tail = new_node

medium

A. tail should be updated before assigning new_node.next

B. new_node.next should be None, not tail

C. head should be updated instead of tail

D. No error, code is correct

Solution

1. Step 1: Check linking of new_node

   new_node.next points to tail, which creates a cycle or wrong link.

2. Step 2: Correct linking for tail insert

   new_node.next should be None because it's new tail; tail.next should point to new_node.

3. Final Answer:

   new_node.next should be None, not tail -> Option B

4. Quick Check:

   New tail's next = None [OK]

Hint: New tail node's next must be None [OK]

Common Mistakes:

• Linking new_node.next to old tail
• Not updating tail.next to new_node
• Confusing head and tail pointers

5. Given a singly linked list with nodes containing values [5, 10, 15], write the sequence of steps to insert a new node with value 20 at the end, and then print the list. What will be the final printed output?

hard

A. [5, 10, 15]

B. [20, 5, 10, 15]

C. [5, 10, 15, 20]

D. [5, 10, 20, 15]

Solution

1. Step 1: Traverse to the last node (value 15)

   Start at head (5), move to 10, then 15 which is tail (next is None).

2. Step 2: Create new node with value 20 and link it

   Set last node's next to new node (20), new node's next is None.

3. Step 3: Traverse and print all nodes

   Traverse from head and collect values: 5, 10, 15, 20.

4. Final Answer:

   [5, 10, 15, 20] -> Option C

5. Quick Check:

   Tail insert adds node at end [OK]

Hint: Traverse to tail, link new node, print full list [OK]

Common Mistakes:

• Inserting new node in middle instead of end
• Not setting new node's next to None
• Forgetting to update last node's next pointer