Musings in generic list reversal

itr-rev.java

public static <A> Node<A> reverse(final Node<A> head) {
  Node<A> curr;
  Node<A> previous = null;
  while (head != null) {
    curr = head.next;
    head.next = previous;
    previous = head;
    head = curr;
  }
  return previous;
}

rec-rev.java

public static <A> List<A> rev(final List<A> list) {
  if (list.isEmpty()) return new LinkedList<A>();
  else {
    List<A> rev = rev(list.subList(1, list.size()));
    rev.add(list.get(0));
    return rev;
  }
}

rev.sc

def rev[A](list: List[A]): List[A] = list match {
  case x :: xs => rev(xs) ::: List(x)
  case Nil => Nil
}