Palindrome Linked List

https://leetcode.com/problems/palindrome-linked-list/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    bool check(ListNode*& left,ListNode *right ){
        if(right == NULL)
            return true;
        bool isP = check(left, right->next);
        if(isP==false)
            return false;
        bool isPal = right->val == (left->val);
        left = (left)->next;
        
        return isPal;
    }
    bool isPalindrome(ListNode* head) {
        return check(head, head);
        
    }
};