Insert at Specific Position in Doubly Linked List in DSA Python - Execution Trace

Concept Flow - Insert at Specific Position in Doubly Linked List

Create new node

↓

Check if position is 0

↓

Insert at head

↓

Traverse to position-1

↓

Adjust pointers to insert

↓

Done

Create a new node, then either insert at the head if position is 0, or traverse to the node before the position and adjust pointers to insert the new node.

Execution Sample

DSA Python

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

def insert_at_pos(head, data, pos):
    # Insert node with data at position pos

This code inserts a new node with given data at a specific position in a doubly linked list.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Create new node with data=25	10 <-> 20 <-> 30 <-> 40	None	10 <-> 20 <-> 30 <-> 40
2	Position=2, start at head	10 <-> 20 <-> 30 <-> 40	current = 10	10 <-> 20 <-> 30 <-> 40
3	Traverse to position-1 (pos=2, move 1 step)	10 <-> 20 <-> 30 <-> 40	current moves to 20	10 <-> 20 <-> 30 <-> 40
4	Adjust pointers to insert new node after current (20)	10 <-> 20 <-> 30 <-> 40	new_node.prev = 20, new_node.next = 30 20.next = new_node 30.prev = new_node	10 <-> 20 <-> 25 <-> 30 <-> 40
5	Insertion complete	10 <-> 20 <-> 25 <-> 30 <-> 40	None	10 <-> 20 <-> 25 <-> 30 <-> 40
6	Exit	10 <-> 20 <-> 25 <-> 30 <-> 40	None	Position reached, insertion done

💡 Insertion done at position 2, pointers updated correctly

Variable Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	Final
head	10	10	10	10	10
current	None	10	20	20	20
new_node.data	None	25	25	25	25
new_node.prev	None	None	None	20	20
new_node.next	None	None	None	30	30

Key Moments - 3 Insights

Why do we stop traversal at position-1 instead of position?

Because we need to insert the new node after the node at position-1, so we stop traversal there to adjust pointers correctly (see Step 3 and Step 4 in execution_table).

What happens if position is 0?

If position is 0, the new node is inserted at the head, adjusting head pointer and next/prev pointers accordingly (not shown in this trace but part of concept_flow).

Why do we update both next and prev pointers when inserting?

Because it's a doubly linked list, each node has pointers to both previous and next nodes, so both must be updated to maintain list integrity (see Step 4 pointer changes).

Visual Quiz - 3 Questions

Look at the execution_table at Step 3, where is the current pointer?

A At node with data 10

B At node with data 20

C At node with data 30

D At node with data 25

💡 Hint

Check the 'Pointer Changes' column at Step 3 in execution_table

At which step do we update the new_node's prev and next pointers?

A Step 4

B Step 3

C Step 2

D Step 5

💡 Hint

Look at the 'Pointer Changes' column describing new_node.prev and new_node.next assignments

If we tried to insert at position 0, what would change in the execution_table?

A New node would be inserted after the last node

B Traversal would go to position-1 as usual

C Traversal steps would be skipped and insertion happens at head

D No insertion would happen

💡 Hint

Refer to concept_flow where position 0 leads to direct insertion at head

Concept Snapshot

Insert at Specific Position in Doubly Linked List:
- Create new node with data
- If position is 0, insert at head
- Else traverse to node at position-1
- Adjust new_node.prev and new_node.next
- Update surrounding nodes' pointers
- Maintain list integrity both ways

Full Transcript

To insert a node at a specific position in a doubly linked list, first create the new node. If the position is zero, insert the node at the head by adjusting the head pointer and the next and prev pointers of involved nodes. Otherwise, start from the head and move forward until reaching the node just before the desired position (position-1). Then, adjust the new node's prev pointer to this node and its next pointer to the next node. Also, update the next pointer of the node at position-1 to the new node, and the prev pointer of the next node to the new node. This keeps the doubly linked list connected correctly in both directions. The execution table shows these steps with the list nodes and pointer changes. Key moments clarify why traversal stops at position-1 and why both pointers must be updated. The visual quiz tests understanding of pointer positions and insertion logic.