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. In a circular linked list, each node points to the previous node instead of the next node

D. Head node is known in circular linked list

Answer: Option A