Implement `linked_list_palindrome(values)`, where `values` is the traversal-order serialization of a singly linked list of integer values. Return whether the values read the same from front to back and back to front. The console uses an array serialization for portable input and output, but the required linked-list algorithm uses `O(n)` time and `O(1)` auxiliary pointer space. Most importantly, it must restore every `next` pointer before returning so a caller observes exactly the original list structure. An empty list and a one-node list are palindromes. ```hint Reuse the second half Find the midpoint with slow and fast pointers, reverse the second half in place, and compare it with the first half. ``` ```hint Restoration is part of correctness Keep enough information to reverse the modified half again and reconnect it before returning, including on a mismatch. ``` ### Discussion Extensions - How does the midpoint handling differ for odd- and even-length lists? - What bug appears if the function returns immediately on the first mismatch?