Topic: Linked List Problem / Level: intermediate

Problem: How do you reverse every third node in a circular singly linked list using recursion?

Run the code to see the output here...