Circular Linked List
The last node points at the first, so a walk ends when it returns to the node where it started.
Costs
| Category | Data Structure |
| Difficulty | Medium |
| Insert at the head, with a tail pointer | O(1) |
| Walk the circle | O(n) |
| Search | O(n) |
Questions
What is Circular Linked List?
The last node points at the first, so a walk ends when it returns to the node where it started.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.