Palindrome Linked List

public class Solution {
    public boolean isPalindrome(ListNode head) {
        if(head == null)    return true;
        
        ListNode mid = getMiddle(head);
        ListNode reverse = getReverse(mid);
        
        while(head!=null && reverse!=null)
        {
            if(head.val == reverse.val)
            {
                head = head.next;
                reverse = reverse.next; 
            }
            else return false;
        }
        
        return true;
        
    }
    public ListNode getMiddle(ListNode head)
    {
        ListNode slow = head;
        ListNode fast = head.next;
        while(fast!=null && fast.next!=null)
        {
            fast = fast.next.next;
            slow = slow.next;
        }
        return slow;
    }
    public ListNode getReverse(ListNode head)
    {
        ListNode dummy = new ListNode(-1);
        while(head != null)
        {
            ListNode next = head.next;
            head.next = dummy.next;
            dummy.next = head;
            head = next;
        }
        return dummy.next;
    }
}