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
This Question Belongs to Data Structure >> Introduction To Data Structures
Related Questions on Introduction to Data Structures
A. A collection of data values
B. A programming language
C. A set of algorithms
D. A way of organizing and storing data
Join The Discussion