Split the nodes of the given list into front and back halves , and return the two lists using the reference parameters . Uses the fast / slow pointer strategy .
static void frontAndBackSplit ( Node head ) { Node slow , fast ; slow = head ; fast = head . next ;