X415: Get Previous Node

question text goes here

Your Answer:

Answer code

public Node<T> getPreviousNode(Node<T> desiredNode) {
    Node<T> current = firstNode;
    while (current.getNext() != null) {
        if (current.getNext().equals(desiredNode)) {
            return current;
        }

        current = current.getNext();
    }
    return null;
}

public void rearrangeChain(Node<T> newHead) {

    // run through the list from the new head to the end
    Node<T> current = newHead;
    while (current.getNext() != null) {
        current = current.getNext();
    }

    // set the node that points to newHead pointing to null
    Node<T> previous = getPreviousNode(newHead);
    if (previous != null) {
        previous.setNext(null);

        current.setNext(firstNode);
        firstNode = newHead;
    }

}

Reset

Visualize

Practice a different Java exercise

Feedback

Your feedback will appear here when you check your answer.