Traversal and Printing a Linked List in DSA C - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to move to the next node in the linked list.

DSA C

current = current[1];

Drag options to blanks, or click blank then click option'

Anext

B.next

C->next

D->prev

Attempts:

3 left

💡 Hint

Common Mistakes

Using dot operator instead of arrow operator for pointer access.

Trying to access a member that doesn't exist like 'prev'.

In C, to access the next node in a linked list through a pointer, use the arrow operator -> followed by the member name next.

2fill in blank

medium

Complete the code to print the integer data of the current node.

DSA C

printf("%d ", current[1]);

Drag options to blanks, or click blank then click option'

A->data

Bdata

C.data

Ddata->

Attempts:

3 left

💡 Hint

Common Mistakes

Using dot operator instead of arrow operator.

Forgetting to access the data member.

Since current is a pointer to a node, use ->data to access the integer data inside the node.

3fill in blank

hard

Fix the error in the loop condition to traverse until the end of the linked list.

DSA C

while (current [1] NULL) {

Drag options to blanks, or click blank then click option'

A!=

B=

C<

D==

Attempts:

3 left

💡 Hint

Common Mistakes

Using assignment operator = instead of comparison.

Using equality operator == which stops at the first node.

The loop should continue while current is not NULL, so use the not equal operator !=.

4fill in blank

hard

Fill both blanks to complete the for loop that traverses and prints the linked list.

DSA C

for (struct Node* current = head; current [1] NULL; current [2]) {
    printf("%d ", current->data);
}

Drag options to blanks, or click blank then click option'

A!=

B==

Ccurrent = current->next

Dcurrent++

Attempts:

3 left

💡 Hint

Common Mistakes

Using current++ which is invalid for pointers to nodes.

Using equality operator == in the loop condition.

The loop continues while current != NULL and moves to the next node with current = current->next.

5fill in blank

hard

Fill all three blanks to create a while loop that traverses and prints the linked list.

DSA C

struct Node* current = [1];
while (current [2] NULL) {
    printf("%d ", current->[3]);
    current = current->next;
}

Drag options to blanks, or click blank then click option'

Ahead

B==

Cdata

D!=

Attempts:

3 left

💡 Hint

Common Mistakes

Using == instead of != in the loop condition.

Printing a wrong member instead of data.

Start from head, loop while current != NULL, and print current->data.