LeetCode #234 Palindrome Linked List Solution & Explanation

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int val=0, ListNode next=null) {
 *         this.val = val;
 *         this.next = next;
 *     }
 * }
 */
public class Solution {
    public bool IsPalindrome(ListNode head) {

        List<int> first = new List<int>();
  
        first.Add(head.val);
        
        while(head.next != null)
        {
            head = head.next;
            first.Add(head.val);
        }
        
        List<int>second = first.ToList();
        first.Reverse();

        return first.SequenceEqual(second);
    }
}