# Reverse Alternate K Nodes in a SIngly Linked List

'''
Given a singly linked list and an integer ‘k’, reverse every ‘k’ element. If k <= 1, then the input list is unchanged. 
If k >= n (n is the length of the linked list), then reverse the whole linked list.

Below is the input linked list and output after reversing every 3 elements:
'''

