Reverse a LinkedList in Scala

Node.scala

case class Node(value: Int, next: Option[Node])
 
def reverse(node: Node, prev: Option[Node] = None): Node = {
  val reversed = node.copy(next = prev)
  node.next map {reverse(_, Some(reversed))} getOrElse reversed
} 
/****************************************************************/
val one = Node(1,Some(Node(2,Some(Node(3,None)))))
println(s"$one\n${reverse(one)}")

@nsfyn55: This was a interview question where each node was presented in Java as:

public class Node(int value, Node next) {}

@v66moroz: Yes, ADTs make more sense here but this was presented in an interview with above Java class as example. I adapted it to Scala.