Data Structure Linked list Question:
Explain circular linked list?
Answer:
In a circular linked list the first and the last node are linked. This means that the last node points to the first node in the list. Circular linked list allow quick access to first and last record using a single pointer.
Previous Question | Next Question |
What is circular linked list? | Explain linked list using C++ with an example? |