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 .
def frontAndBackSplit ( head ) : NEW_LINE INDENT global front NEW_LINE global back NEW_LINE slow = None NEW_LINE fast = None NEW_LINE slow = head NEW_LINE fast = head . next NEW_LINE DEDENT