Traversal and Printing a Linked List in DSA C - Execution Trace

Concept Flow - Traversal and Printing a Linked List

Start at head node

↓

Is current node NULL?

Yes→Stop traversal

No↓

Print current node data

↓

Move to next node

↩Back to check current node

Start from the first node, print its data, move to the next node, and repeat until no nodes remain.

Execution Sample

DSA C

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

void printList(struct Node* head) {
  struct Node* current = head;
  while (current != NULL) {
    printf("%d -> ", current->data);
    current = current->next;
  }
  printf("NULL\n");
}

This code walks through each node in the linked list from head to end, printing the data values.

Execution Table

Step	Operation	Current Node Data	Pointer Changes	Visual State
1	Start at head	10	current = head (node with 10)	10 -> 20 -> 30 -> NULL
2	Print current node data	10	No pointer change	10 -> 20 -> 30 -> NULL
3	Move to next node	20	current = current->next (node with 20)	10 -> 20 -> 30 -> NULL
4	Print current node data	20	No pointer change	10 -> 20 -> 30 -> NULL
5	Move to next node	30	current = current->next (node with 30)	10 -> 20 -> 30 -> NULL
6	Print current node data	30	No pointer change	10 -> 20 -> 30 -> NULL
7	Move to next node	NULL	current = current->next (NULL)	10 -> 20 -> 30 -> NULL
8	Check current node	NULL	current == NULL, stop traversal	10 -> 20 -> 30 -> NULL

💡 Traversal stops when current pointer becomes NULL, meaning end of list reached.

Variable Tracker

Variable	Start	After Step 3	After Step 5	After Step 7	Final
current	head (node with 10)	node with 20	node with 30	NULL	NULL

Key Moments - 3 Insights

Why do we check if current is NULL before printing?

Because if current is NULL, it means we reached the end of the list and there is no data to print. This is shown in execution_table step 8 where traversal stops.

Why do we move current to current->next after printing?

To advance to the next node in the list so we can print its data next. This is shown in steps 3, 5, and 7 where current pointer moves forward.

What does the visual state '10 -> 20 -> 30 -> NULL' represent?

It shows the linked list nodes and their order. The arrows mean each node points to the next, ending with NULL meaning no more nodes.

Visual Quiz - 3 Questions

Look at the execution_table, what is the value of current after step 5?

A NULL

B Node with data 20

C Node with data 30

D Node with data 10

💡 Hint

Check the 'Pointer Changes' and 'Current Node Data' columns at step 5 in execution_table.

At which step does the traversal stop because current becomes NULL?

A Step 6

B Step 8

C Step 7

D Step 5

💡 Hint

Look at the 'Operation' and 'Pointer Changes' columns in execution_table for when current == NULL.

If the list had only one node with data 5, how many print operations would occur?

A 1

B 0

C 2

D 3

💡 Hint

Refer to variable_tracker and execution_table logic for how many times printing happens per node.

Concept Snapshot

Traversal and Printing a Linked List:
- Start at head node
- While current node is not NULL:
  - Print current node data
  - Move to next node
- Stop when current is NULL
- Output format: data -> data -> ... -> NULL

Full Transcript

Traversal and printing a linked list means starting at the first node and moving through each node one by one. At each node, we print its data. We keep moving to the next node until we reach the end, which is marked by a NULL pointer. The code uses a pointer called current to track which node we are at. We check if current is NULL before printing to avoid errors. After printing, we move current to the next node. This repeats until current becomes NULL, which stops the traversal. The linked list is shown visually as nodes connected by arrows ending with NULL.