python:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def isPalindrome(self, head: ListNode) -> bool:
len = 0
p = head
vals = []
while p!=None:
len = len + 1
vals.append(p.val)
p = p.next
# for i in range(len//2):
# if(vals[i]!=vals[len-1-i]):
# return False
# return True
return vals==vals[::-1]