I am brushing up on my data structures by reading a book and one of the questions it asks is to build a circular Single Linked List by not using \"first\" & \"last\" po
Since the linked list is circular, there would be no first and last element.
You can traverse entire list starting from any node (current in this context).
So Node class would only have a next reference, and CircularLinkedList will have only current reference.
Node
CircularLinkedList
Hope this helps. Good luck.