Method checkPalindrome

12_LinkedList.java/LL.java:189–216

()

    }

    public boolean checkPalindrome() {
        if(head == null || head.next == null) {
            return true;
        }
        //find middle
        Node mid = findMidNode(head);

        //Reverse 2nd half
        Node curr = mid;
        Node prev = null;
        while(curr != null) {
            Node next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        Node right = prev;
        Node left = head;
        //check if equal
        while(right != null) {
            if(left.data != right.data) {
                return false;
            }
            left = left.next;
            right = right.next;
        }
        return true;
    }

    public boolean isCycle() {
        Node slow = head;