Reverse a linked list by given K size slots with recursion

ReverseLinkedListKSizeSlots.java

public class ReverseLinkedListKSizeSlots {

    public Node reverseRecursion(Node root, int k) {

        Node current = root;
        Node prev = null;
        Node next = null;
        int count = 0;

        while (current != null && count < k) {

            next = current.next;
            current.next = prev;
            prev = current;
            current = next;
            count++;
        }

        if (next != null) {

            root.next = reverseRecursion(next, k);
        }

        return prev;
    }
}

ReverseLinkedListKSizeSlotsTest.java

import org.junit.Before;
import org.junit.Test;

public class ReverseLinkedListKSizeSlotsTest {

    private ReverseLinkedListKSizeSlots testClass;
    private LinkedList                  list;

    @Before
    public void setUp() {

        testClass = new ReverseLinkedListKSizeSlots();
        list = new LinkedList();
        init();
    }

    @Test
    public void test1() {

        testClass.printKSizeSlotsReversed(list, 3);
    }

    @Test
    public void tets2() {

        Node head = testClass.reverseRecursion(list.head, 3);
        Node temp = head;
        while (temp != null) {

            System.out.print(temp.data + " --> ");
            temp = temp.next;
        }
    }

    private void init() {

        list = new LinkedList();
        list.insert(1);
        list.insert(2);
        list.insert(3);
        list.insert(4);
        list.insert(5);
        list.insert(6);
        list.insert(7);
        list.insert(8);
    }
}