LinkedListPalindrome.java

class LinkedList{
 
Node head;
Node left;
 
public class Node
{
    public char data;
    public Node next;
 
    public Node(char d)
    {
        data = d;
        next = null;
    }
}
boolean isPalindromeUtil(Node right)
{
    left = head;
    if (right == null)
        return true;
    boolean isp = isPalindromeUtil(right.next);
    if (isp == false)
        return false;
 
    boolean isp1 = (right.data == left.data);
 
    left = left.next;
 
    return isp1;
}
 
boolean isPalindrome(Node head)
{
    boolean result = isPalindromeUtil(head);
    return result;
}
 
public void push(char new_data)
{
     
    Node new_node = new Node(new_data);
 
    new_node.next = head;
 
    head = new_node;
}
 
void printList(Node ptr)
{
    while (ptr != null)
    {
        System.out.print(ptr.data + "->");
        ptr = ptr.next;
    }
    System.out.println("Null");
}

public static void main(String[] args)
{
    LinkedList llist = new LinkedList();
    char[] str = { 'a', 'b', 'a', 'c', 'a', 'b', 'a' };
    for(int i = 0; i < 7; i++)
    {
        llist.push(str[i]);
        llist.printList(llist.head);
         
        if (llist.isPalindrome(llist.head))
        {
            System.out.println("Is Palindrome");
            System.out.println("");
        }
        else
        {
            System.out.println("Not Palindrome");
            System.out.println("");
        }
    }
}
}