What differentiates a circular linked list from a normal linked list?
2024
What differentiates a circular linked list from a normal linked list?
- A.
You cannot have the ‘next’ pointer point to null in a circular linked list
- B.
It is faster to traverse the circular linked list
- C.
You may or may not have the ‘next’ pointer point to null in a circular linked list
- D.
Head node is known in circular linked list
Attempted by 216 students.
Show answer & explanation
Correct answer: C
Answer: c
Explanation: The ‘next’ pointer points to null only when the list is empty, otherwise it points to the head of the list. Every node in a circular linked list can be a starting point(head).