Multiple choice

How many ways a linear linked list can be traversed?

  1. 2

  2. 3

  3. 4

  4. 5
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A linear linked list can be traversed in exactly two ways: forward from the head node to the tail node using the next pointers, and backward by first reversing the list then traversing. While doubly linked lists allow bidirectional traversal without reversal, linear lists require this extra step for reverse traversal.

Keep practicing — related questions