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
Answer:C
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
Explanation: When the list is empty, the ‘next’ pointer points to null; otherwise, it points to the top of the list. A starting point may be any node in a circular connected list (head).