Enqueue Operation in DSA Python - Execution Trace

Concept Flow - Enqueue Operation

Create new node with value

↓

Is queue empty?

Yes→Set head and tail to new node

No↓

Set tail.next to new node

↓

Update tail to new node

↓

Done

The enqueue operation adds a new node at the end of the queue. If the queue is empty, head and tail point to the new node. Otherwise, the new node is linked after tail and tail is updated.

Execution Sample

DSA Python

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

class Queue:
    def __init__(self):
        self.head = None
        self.tail = None

    def enqueue(self, val):
        new_node = Node(val)
        if not self.head:
            self.head = new_node
            self.tail = new_node
        else:
            self.tail.next = new_node
            self.tail = new_node

This code adds a new value to the end of the queue, updating pointers accordingly.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Create new node with value 10	None	None	null
2	Check if queue is empty (head is None)	None	head=None, tail=None	null
3	Queue empty: set head and tail to new node	10	head -> 10, tail -> 10	10 -> null
4	Create new node with value 20	10	head -> 10, tail -> 10	10 -> null
5	Check if queue is empty (head is not None)	10	head -> 10, tail -> 10	10 -> null
6	Link tail.next to new node	10 -> 20	tail.next -> 20	10 -> 20 -> null
7	Update tail to new node	10 -> 20	tail -> 20	10 -> 20 -> null
8	Create new node with value 30	10 -> 20	head -> 10, tail -> 20	10 -> 20 -> null
9	Check if queue is empty (head is not None)	10 -> 20	head -> 10, tail -> 20	10 -> 20 -> null
10	Link tail.next to new node	10 -> 20 -> 30	tail.next -> 30	10 -> 20 -> 30 -> null
11	Update tail to new node	10 -> 20 -> 30	tail -> 30	10 -> 20 -> 30 -> null
12	End of enqueue operations	10 -> 20 -> 30	head -> 10, tail -> 30	10 -> 20 -> 30 -> null

💡 All enqueue operations complete; queue updated with new nodes at tail.

Variable Tracker

Variable	Start	After Step 3	After Step 7	After Step 11	Final
head	None	Node(10)	Node(10)	Node(10)	Node(10)
tail	None	Node(10)	Node(20)	Node(30)	Node(30)
Nodes in List	Empty	10 -> null	10 -> 20 -> null	10 -> 20 -> 30 -> null	10 -> 20 -> 30 -> null

Key Moments - 3 Insights

Why do we set both head and tail to the new node when the queue is empty?

When the queue is empty (head is None), the new node is the only node. So head and tail must both point to it. This is shown in step 3 where head and tail are set to Node(10).

Why do we update tail.next before moving tail to the new node?

We link the current tail's next pointer to the new node first (step 6) to maintain the chain. Then we update tail to the new node (step 7). This keeps the queue connected.

What happens if we forget to update tail after enqueue?

If tail is not updated, new nodes won't be added at the end correctly. The queue's tail pointer would be wrong, breaking the enqueue logic. This is why step 7 and 11 are crucial.

Visual Quiz - 3 Questions

Look at the execution table at step 3. What does the queue look like after this step?

A 20 -> null

B 10 -> null

C null

D 10 -> 20 -> null

💡 Hint

Check the 'Visual State' column at step 3 in the execution_table.

At which step does the tail pointer first move from Node(10) to Node(20)?

A Step 3

B Step 6

C Step 7

D Step 11

💡 Hint

Look at the 'Pointer Changes' column for tail updates in the execution_table.

If the queue was initially empty, what would happen if we skipped setting head in step 3?

A The queue would have no head, causing errors when dequeuing.

B The queue would still work correctly.

C Tail would point to None but head would be correct.

D The new node would be lost but tail would be correct.

💡 Hint

Refer to the key moment about setting head and tail when queue is empty.

Concept Snapshot

Enqueue Operation in Queue:
- Create a new node with the value.
- If queue empty, set head and tail to new node.
- Else, link tail.next to new node.
- Update tail to new node.
- Maintains FIFO order by adding at tail.

Full Transcript

The enqueue operation adds a new element to the end of a queue. First, a new node is created with the given value. If the queue is empty, both head and tail pointers are set to this new node, making it the only element. If not empty, the current tail's next pointer is linked to the new node, and then the tail pointer is updated to point to this new node. This process ensures the queue maintains the correct order of elements, adding new ones at the end. The execution table shows step-by-step how nodes are created and linked, and how pointers change. The variable tracker monitors head, tail, and the list of nodes after each operation. Key moments clarify why both head and tail must be set when empty, why tail.next is updated before tail, and the importance of updating tail to avoid breaking the queue. The visual quiz tests understanding of queue state and pointer updates during enqueue.