Traversal and Printing a Linked List in DSA Java - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main purpose of traversing a linked list?

To visit each node in the linked list one by one, usually to read or process the data stored in each node.

beginner

In a singly linked list, how do you move from one node to the next?

By following the 'next' pointer/reference in the current node to reach the next node in the list.

beginner

What condition is used to stop traversing a linked list?

When the current node is null, meaning there are no more nodes to visit.

beginner

Why is printing a linked list useful during debugging?

It helps visualize the order and content of nodes, making it easier to find errors or understand the list's state.

beginner

What is the output format when printing a linked list like 1 -> 2 -> 3 -> null?

It shows each node's data followed by an arrow '->' pointing to the next node, ending with 'null' to indicate the list's end.

What does the 'next' pointer in a linked list node represent?

A The address of the next node in the list

B The data stored in the node

C The previous node in the list

D The size of the list

The 'next' pointer holds the reference to the next node, allowing traversal through the list.

When traversing a linked list, when should you stop?

A After visiting the first node

B When the current node is null

C When the current node's next pointer is null

D After visiting the last two nodes

Traversal stops when the current node itself is null, meaning no more nodes to visit.

What is the output of printing a linked list with nodes containing 5, 10, 15?

A 5 10 15

B null -> 5 -> 10 -> 15

C 5 -> 10 -> 15 -> null

D 15 -> 10 -> 5 -> null

The standard print format shows nodes in order with arrows and ends with null.

Which of these is NOT a step in traversing a linked list?

A Start at the head node

B Move to the next node using the next pointer

C Stop when the current node is null

D Jump to a random node in the list

Traversal follows the next pointers sequentially, not random jumps.

Why do we print 'null' at the end of a linked list?

A To show the list has ended

B To indicate an error

C To show the list is empty

D To mark the first node

'null' indicates there is no next node, marking the end of the list.

Explain how to traverse and print all elements of a singly linked list.

Think about following the next pointers from the first node until you reach the end.

Describe why printing a linked list is helpful when learning about linked lists.

Imagine trying to see what is inside the list without printing it.

Practice

1. What is the main purpose of traversing a linked list in Java?

easy

A. To sort the linked list nodes automatically

B. To delete the entire linked list at once

C. To create a new linked list from scratch

D. To visit each node and perform an action like printing its value

Solution

1. Step 1: Understand traversal meaning

   Traversal means visiting each node one by one in the linked list.

2. Step 2: Identify traversal purpose

   Commonly, traversal is used to perform actions like printing or searching nodes.

3. Final Answer:

   To visit each node and perform an action like printing its value -> Option D

4. Quick Check:

   Traversal = Visit nodes [OK]

Hint: Traversal means visiting nodes one by one [OK]

Common Mistakes:

• Confusing traversal with deletion
• Thinking traversal creates a new list
• Assuming traversal sorts the list

2. Which of the following is the correct syntax to start traversing a singly linked list named head in Java?

easy

A. Node current = head.next;

B. Node current = null;

C. Node current = head;

D. Node current = head.prev;

Solution

1. Step 1: Identify starting point of traversal

   Traversal starts from the first node, which is referenced by head.

2. Step 2: Choose correct initialization

   We assign current to head to begin traversal at the first node.

3. Final Answer:

   Node current = head; -> Option C

4. Quick Check:

   Start traversal at head node [OK]

Hint: Start traversal from head node reference [OK]

Common Mistakes:

• Starting from head.next skips first node
• Initializing current to null causes no traversal
• Using head.prev in singly linked list causes error

3. What will be the output of the following Java code snippet?

class Node {
  int data;
  Node next;
  Node(int d) { data = d; next = null; }
}

public class Main {
  public static void main(String[] args) {
    Node head = new Node(5);
    head.next = new Node(10);
    head.next.next = new Node(15);

    Node current = head;
    while (current != null) {
      System.out.print(current.data + " -> ");
      current = current.next;
    }
    System.out.print("null");
  }
}

medium

A. 5 -> 10 -> 15 -> null

B. null -> 5 -> 10 -> 15

C. 5 10 15 null

D. 5 -> 10 -> null

Solution

1. Step 1: Trace node creation and linking

   Nodes created with data 5, 10, 15 linked as 5 -> 10 -> 15 -> null.

2. Step 2: Follow while loop printing

   Loop prints each node's data followed by ' -> ', then ends with 'null'.

3. Final Answer:

   5 -> 10 -> 15 -> null -> Option A

4. Quick Check:

   Print nodes in order with arrows [OK]

Hint: Print each node data with arrow until null [OK]

Common Mistakes:

• Printing null at start instead of end
• Missing arrows between nodes
• Stopping before last node

4. Identify the error in the following code snippet for printing a linked list and select the correct fix.

Node current = head;
while (current.next != null) {
  System.out.print(current.data + " -> ");
  current = current.next;
}
System.out.print("null");

medium

A. Remove System.out.print("null") line

B. Change condition to current != null to print last node

C. Initialize current to head.next to skip first node

D. Add current = current.next inside the loop

Solution

1. Step 1: Analyze loop condition

   The loop stops when current.next is null, so last node is not printed.

2. Step 2: Fix condition to include last node

   Changing condition to current != null ensures last node is printed.

3. Final Answer:

   Change condition to current != null to print last node -> Option B

4. Quick Check:

   Loop until current is null to print all nodes [OK]

Hint: Loop until current is null to include last node [OK]

Common Mistakes:

• Using current.next != null misses last node
• Skipping first node by wrong initialization
• Removing null print causes unclear output

5. Given a singly linked list, how would you modify the traversal code to print the list in reverse order without changing the list structure?

hard

A. Use recursion to traverse to the end, then print nodes on return

B. Reverse the list first, then traverse normally

C. Use a loop to print nodes from tail to head directly

D. Print nodes while moving forward, then print again backward

Solution

1. Step 1: Understand limitation of singly linked list

   Singly linked list nodes only point forward, so backward traversal is not direct.

2. Step 2: Use recursion to print in reverse

   Recursion goes to end first, then prints nodes on returning back, achieving reverse print without changing list.

3. Final Answer:

   Use recursion to traverse to the end, then print nodes on return -> Option A

4. Quick Check:

   Recursion prints reverse without modifying list [OK]

Hint: Recursion prints reverse by returning from end [OK]

Common Mistakes:

• Trying to loop backward in singly linked list
• Reversing list changes structure, not allowed here
• Printing twice forward and backward duplicates output