Leetcode-Easy 234. Palindrome Linked List

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def isPalindrome(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        node_list=[]
        while head:
            node_list.append(head)
            head=head.next
            
      
        for i in range(int(len(node_list)/2)):
            print(node_list[i].val,node_list[-i-1].val)
            if node_list[i].val!=node_list[-i-1].val:
                return False
        return True