Question

Do it in Java: Directions

Linked Reverse Step 1. In the reverse method of LList, implement your algorithm from the pre-lab exercises. Iteration is needed. Checkpoint: Compile and run LinkedListExtensionsTest. The checkReverse tests should pass. If not, debug and retest.

Linked Cycle Step 2. In the cycle method of LList, implement your algorithm from the pre-lab exercises. Final checkpoint: Compile and run LinkedListExtensionsTest. All tests should pass. If not, debug and retest.

-----LList Skele Code------

https://codeshare.io/5QqeOe <----LList Code

-------LinkedListExtensionsTest code-----

https://codeshare.io/G6LbmO <--------LinkedListExtensionsTest.java This test LList

Answer 1

public void reverse() {

    if (!isEmpty()) {

        Node current = firstNode;
        Node prev = null;
        Node next = null;

        while (current != null) {
            next = current.getNextNode();
            current.setNextNode(prev);
            prev = current;
            current = next;
        }

        firstNode = prev;
    }
}


public void cycle() {

    if (numberOfEntries > 1) {

        Node f = firstNode;

        firstNode = firstNode.next;

        f.setNextNode(null);

        Node start = firstNode;
        while(start.next != null) {
            start = start.next;
        }

        start.setNextNode(f);
    }
}

Please upvote, as i have given the exact answer as asked in question. Still in case of any concerns in code, let me know in comments. Thanks!