Q. What differentiates a circular linked list from a normal linked list? (Solved)
1. You cannot have the ‘next’ pointer point to null in a circular linked list
2. It is faster to traverse the circular linked list
3. You may or may not have the ‘next’ pointer point to null in a circular linked list
4. Head node is known in circular linked list
- c. You may or may not have the ‘next’ pointer point to null in a circular linked list