Which of the following ways can be traversed on linear linked list?
-
In-order traversal
-
Reverse-order traversal
-
Both (1) & (2)
-
None of these
C
Correct answer
Explanation
Linear linked lists support both in-order (forward) traversal from head to tail following next pointers, and reverse-order traversal by first reversing the list or using recursion. While reverse traversal requires additional processing compared to doubly linked lists, it is still achievable on linear structures.