293031323334353637383940414243444546474849505152535455565758596061626364656667

import java.io.*;

class ListNode {
    int val; 
    ListNode next; 
    ListNode(int data1) {
        val = data1;
        next = null;
    }

    ListNode(int data1, ListNode next1) {
        val = data1;
        next = next1;
    }
}


class Solution {
     //Function for Linked List Traversal
    public List<Integer> LLTraversal(ListNode head) {
        //Storing a copy of the linked list
        ListNode temp = head;
        //To store the values sequentially
        List<Integer> ans = new ArrayList<>();
        
        //Keep traversing
        //Until null is encountered
        while (temp != null) {
            //Storing the values
            ans.add(temp.val);
            //Storing the address of the next node
            temp = temp.next;
        }
        //Return answer
        return ans;
    }
}

public class Main {
    public static void main(String[] args) {
        //Manual creation of nodes
        ListNode y1 = new ListNode(2);
        ListNode y2 = new ListNode(5);
        ListNode y3 = new ListNode(8);
        ListNode y4 = new ListNode(7);

        // Linking the nodes
        y1.next = y2;
        y2.next = y3;
        y3.next = y4;

        // Creating an instance of 
        //Solution class
        Solution solution = new Solution();

        // Calling LLTraversal method 
        //To get the values
        List<Integer> result = solution.LLTraversal(y1);

        // Printing the result
        System.out.println("Linked List Values:");
        for (int val : result) {
            System.out.print(val + " ");
        }
        System.out.println();
    }
}

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class Solution:
    # Function for Linked List Traversal
    def LLTraversal(self, head: ListNode) -> list:
        # Storing a copy 
        #Of the linked list
        temp = head
        #To store 
        #Values sequentially
        ans = []

        #Keep traversing
        #Until the None 
        #Is not encountered
        while temp is not None:
            #Storing of the values
            ans.append(temp.val)
            #Storing the address 
            #Of the next node
            temp = temp.next

        #Returning the answer 
        return ans

if __name__ == "__main__":
    #Manual creation of nodes
    y1 = ListNode(2)
    y2 = ListNode(5)
    y3 = ListNode(8)
    y4 = ListNode(7)

    #Linking the nodes
    y1.next = y2
    y2.