public void act(Node head){
        
        Node result = null;
        LinkList ll = new LinkList();
        while(head != null && head.next != null){
            Node temp = head.next;
            head.next = head.next.next;
            temp.next = null;
            result = ll.addAtFront(temp,result);
            if(head.next == null){
                break;
            }
            head = head.next;
        }
        head.next = result;
    }
http://www.geeksforgeeks.org/given-linked-list-reverse-alternate-nodes-append-end/
Test case
Even and odd number of nodes
src/com/interview/linklist/ReverseAlternateNodeAndAppendAtEnd.java