What differentiates a circular linked list from a normal linked list?

Q & ACategory: Data StructureWhat differentiates a circular linked list from a normal linked list?
Admin Staff asked 4 years ago

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

1 Answers
Admin Staff answered 4 years ago

c) You may or may not have the ‘next’ pointer point to null in a circular linked list