Remove the First Node Holding a Value

Unlike a counted walk, this one stops on data you cannot predict, so carry two cursors: previous stays one node behind current, because the link you must rewire lives in previous.

Requirements:
1. remove(int value) unlinks the FIRST node holding value and returns true.
2. It returns false when no node holds value, including on an empty list.
3. A match on the head node is its own branch - there is no previous node to rewire.

The Node class is provided - do not rename it and do not add public to it, because a Java source file may contain only one public class.

Do NOT write a main method.

Expected Output:

true↵
10 -> 30 -> 20 -> null↵
true↵
true↵
10 -> 30 -> null↵
false↵

= newline. The output ends with a newline — print one after the last line.

Hints4 available

Topics:

Data Structures & AlgorithmsLinked Lists

Code Editor

Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (sysout, psvm, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.