Linked List Palindrome

LinkedListPalindrome.java

boolean isPalindrome(Node n){
    Node fast = n;
    Node slow = n;

    // push first half onto stack, then compare with second half
    Stack<Integer> s = new Stack<Integer>();
    while(fast != null && fast.next != null) {
        s.push(slow.data);
        slow = slow.next;
        fast = fast.next.next;
    }

    // if odd length, skip middle element since it doesn't matter for palindromes
    if(fast != null) {
        slow = slow.next;
    }

    while(slow != null) {
        int popped = s.pop();
        if(popped != slow.data) {
            return false;
        }
    }

    return true;
}