Delete Node at Beginning in DSA C - Execution Trace

Concept Flow - Delete Node at Beginning

Start

↓

Check if list is empty?

Yes→Nothing to delete, EXIT

No↓

Save pointer to first node

↓

Move head to second node

↓

Free memory of old first node

↓

Return updated list

↓

END

This flow checks if the list is empty, then removes the first node by moving the head pointer and freeing the old node.

Execution Sample

DSA C

struct Node {
    int data;
    struct Node* next;
};

void deleteAtBeginning(struct Node** head) {
    if (*head == NULL) return;
    struct Node* temp = *head;
    *head = (*head)->next;
    free(temp);
}

This code deletes the first node of a singly linked list by updating the head pointer and freeing the old first node.

Execution Table

Step	Condition (*head == NULL)	Action	Head Node Data	List State
1	False	Save temp = head (Node with data 10)	10	10 -> 20 -> 30 -> NULL
2	N/A	Move head to next node (20)	20	20 -> 30 -> NULL
3	N/A	Free old first node (10)	20	20 -> 30 -> NULL
4	N/A	Return updated list	20	20 -> 30 -> NULL
5	N/A	Exit	20	20 -> 30 -> NULL

💡 Head moved to second node; old first node freed; list updated.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	Final
*head	10 -> 20 -> 30 -> NULL	10 -> 20 -> 30 -> NULL	20 -> 30 -> NULL	20 -> 30 -> NULL	20 -> 30 -> NULL
temp	N/A	10 -> 20 -> 30 -> NULL	10 -> 20 -> 30 -> NULL	Freed	Freed

Key Moments - 3 Insights

Why do we check if the list is empty before deleting?

Because if the list is empty (*head == NULL), there is no node to delete. The execution_table row 1 shows this check prevents errors.

Why do we save the first node in a temporary variable before moving the head?

We save it to free its memory later. If we move head first, we lose reference to the old node and can't free it. See execution_table steps 1 and 3.

What happens to the list after deleting the first node?

The head points to the second node, effectively removing the first node from the list. The list state changes from '10 -> 20 -> 30' to '20 -> 30' as shown in execution_table steps 2 and 4.

Visual Quiz - 3 Questions

Look at the execution_table, what is the head node data after step 2?

A 20

B 10

C 30

D NULL

💡 Hint

Check the 'Head Node Data' column at step 2 in the execution_table.

At which step is the old first node freed?

A Step 1

B Step 2

C Step 3

D Step 4

💡 Hint

Look for the action mentioning 'Free old first node' in the execution_table.

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

A The function would free a node

B The function would return immediately without changes

C The function would move head to next node

D The function would crash

💡 Hint

Refer to the condition check '*head == NULL' in execution_table step 1.

Concept Snapshot

Delete Node at Beginning:
- Check if list is empty (*head == NULL)
- Save first node in temp
- Move head to second node
- Free old first node
- Updated list starts from new head

Full Transcript

This concept shows how to delete the first node of a singly linked list in C. First, we check if the list is empty to avoid errors. If not empty, we save the first node in a temporary pointer. Then, we move the head pointer to the second node. After that, we free the memory of the old first node to avoid memory leaks. Finally, the list starts from the new head node. The execution table traces these steps with the list initially containing nodes with data 10, 20, and 30. After deletion, the list starts at 20. The variable tracker shows how the head pointer and temp variable change during execution. Key moments clarify why each step is important. The visual quiz tests understanding of the head pointer's value and the freeing step.