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)}")

I would suggest using different structure for your linked list, Option reminds me null in this context.

sealed trait MyList[+A] {
  def reverse = {
    @annotation.tailrec
    def reverse_r[A](xs: MyList[A], acc: MyList[A]): MyList[A] = {
      xs match {
        case Empty          => acc
        case Node(v, next)  => reverse_r(next, Node(v, acc))
      }
    }
    reverse_r(this, Empty)
  }
}

case object Empty extends MyList[Nothing]

case class Node[A](value: A, next: MyList[A]) extends MyList[A]

Node(1, Node(2, Node(3, Empty))).reverse        //> res0: T.MyList[Int] = Node(3,Node(2,Node(1,Empty)))
Empty.reverse                                   //> res1: T.MyList[Nothing] = Empty

@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.