Multiple choice

A linear linked list except that the last element points to the first element is called

  1. circular linked list

  2. doubly linked list

  3. both (1) & (2)

  4. none of these

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A circular linked list is a variation of linear linked list where the last element's next pointer points back to the first element instead of NULL. This creates a continuous loop structure useful for applications like round-robin scheduling or implementing circular buffers.