public boolean isPalindrome(ListNode head) {
	        
	        if(head==null)
	        return false;
	        
	        if(head.next==null)
	        return true;
	        
	        ListNode fast=head;
	        ListNode slow=head;

	        while(fast.next!=null && fast.next.next!=null)
	        {
	            fast=fast.next;
	            fast=fast.next;
	            slow=slow.next;
	        }
	        
	        ListNode head2=reverseLinkedList(slow.next);
	        ListNode it=head2;
			while(it!=null)
			{
				System.out.print(it.getval());
				it=it.next;
			}
	        
	        boolean result=true;
	        
	        while(head2!=null)
	        {
	            
	            if(head.val!=head2.val)
	            {
	                result=false;
	                break;
	            }
	            else
	            {
	                head=head.next;
	                head2=head2.next;
	            }
	        }
	        
	        return result;
	        
	    }