Delete from Beginning of Doubly Linked List in DSA C - Execution Trace

Concept Flow - Delete from Beginning of Doubly Linked List

Start at head

↓

Check if head is NULL?

Yes→List empty, nothing to delete

No↓

Move head to head->next

↓

If new head not NULL, set new head->prev = NULL

↓

Delete old head node

↓

Done

Start at the head node, check if list is empty. If not, move head to next node, update pointers, delete old head.

Execution Sample

DSA C

void deleteFromBeginning() {
  if (head == NULL) return;
  Node* temp = head;
  head = head->next;
  if (head != NULL) head->prev = NULL;
  free(temp);
}

Deletes the first node of a doubly linked list by moving head and updating pointers.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Start with list	10 <-> 20 <-> 30 <-> NULL	head → node with 10	┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ prev:∅ │←── │ prev:10│←── │ prev:20│ │ next:20│──→ │ next:30│──→ │ next:∅ │ └────────┘ └────────┘ └────────┘ head
2	Check if head is NULL	10 <-> 20 <-> 30 <-> NULL	head not NULL, continue	Same as step 1
3	Set temp = head	10 <-> 20 <-> 30 <-> NULL	temp → node with 10	Same as step 1
4	Move head to head->next	20 <-> 30 <-> NULL	head → node with 20	┌────────┐ ┌────────┐ │ data:20│ │ data:30│ │ prev:10│←── │ prev:20│←── │ next:30│──→ │ next:∅ │ └────────┘ └────────┘ head
5	Set new head->prev = NULL	20 <-> 30 <-> NULL	head->prev = NULL	┌────────┐ ┌────────┐ │ data:20│ │ data:30│ │ prev:∅ │←── │ prev:20│←── │ next:30│──→ │ next:∅ │ └────────┘ └────────┘ head
6	Free old head (node with 10)	20 <-> 30 <-> NULL	temp freed	┌────────┐ ┌────────┐ │ data:20│ │ data:30│ │ prev:∅ │←── │ prev:20│←── │ next:30│──→ │ next:∅ │ └────────┘ └────────┘ head
7	End	20 <-> 30 <-> NULL	head points to node with 20	Final list state as step 6

💡 Execution stops after deleting the first node and updating head pointer.

Variable Tracker

Variable	Start	After Step 3	After Step 4	After Step 5	Final
head	node with 10	node with 10	node with 20	node with 20	node with 20
temp	NULL	node with 10	node with 10	node with 10	freed
head->prev	NULL	NULL	node with 10	NULL	NULL

Key Moments - 3 Insights

Why do we set head->prev = NULL after moving head to next node?

Because the new head is now the first node, it should not have a previous node. This is shown in step 5 of the execution_table where head->prev changes from node with 10 to NULL.

What happens if the list is empty when we try to delete from beginning?

The function checks if head is NULL at step 2. If it is NULL, it returns immediately without doing anything, so no deletion occurs.

Why do we free the old head node after moving head pointer?

We free the old head to release memory and avoid memory leaks. This is done in step 6 after head moves to the next node.

Visual Quiz - 3 Questions

Look at the execution_table, what is the value of head after step 4?

A Node with data 10

B Node with data 20

C NULL

D Node with data 30

💡 Hint

Check the 'Pointer Changes' column at step 4 in execution_table.

At which step does head->prev get set to NULL?

A Step 5

B Step 3

C Step 2

D Step 6

💡 Hint

Look at the 'Operation' and 'Pointer Changes' columns in execution_table.

If the list was empty initially, what would happen at step 2?

A head moves to next node

B temp is set to head

C Function returns immediately

D Old head node is freed

💡 Hint

Refer to the 'Check if head is NULL' operation in execution_table step 2.

Concept Snapshot

Delete from Beginning of Doubly Linked List:
- Check if list is empty (head == NULL)
- Save current head in temp
- Move head to head->next
- If new head exists, set head->prev = NULL
- Free old head node
- List size decreases by one
- Handles empty list safely

Full Transcript

This visual trace shows how to delete the first node from a doubly linked list. We start by checking if the list is empty. If not, we save the current head node in a temporary pointer. Then we move the head pointer to the next node. If the new head is not null, we set its previous pointer to null because it is now the first node. Finally, we free the old head node to release memory. The execution table shows each step with the list nodes and pointer changes. The variable tracker follows the head and temp pointers and the head's previous pointer. Key moments clarify why we update head->prev and why we free the old node. The quiz tests understanding of pointer updates and empty list handling. This method safely removes the first node and updates the doubly linked list structure.