public static void main(String args[]){
        LinkList ll = new LinkList();
        Node head = null;
        head = ll.addNode(1, head);
        head = ll.addNode(2, head);
        head = ll.addNode(3, head);
        head = ll.addNode(4, head);
        head = ll.addNode(5, head);
        head = ll.addNode(6, head);
        head = ll.addNode(7, head);
        head = ll.addNode(8, head);
        
        ReverseAlternateKNodes ra = new ReverseAlternateKNodes();
        head = ra.reverse(head, 3, false);
        ll.printList(head);
    }
http://www.geeksforgeeks.org/reverse-alternate-k-nodes-in-a-singly-linked-list/
Test case
k is even odd
number of nodes are even odd
k is less than or equal to 1.
src/com/interview/linklist/ReverseAlternateKNodes.java