boolean isPalindrome() {
        Node reverse = this.reverseCopy();

        Node n = this;
        Node r = reverse;
        if(n.data != r.data) {
            return false;
        }
        
        while(n.next != null) {
            n = n.next;
            r = r.next;
            if(n.data != r.data) {
                return false;
            }
        }
        return true;
    }