@@ -0,0 +1,1032 @@
+import java.io.*;%0Aimport java.util.*;%0A%0Aclass Node %7B%0A%09int data;%0A%09Node next;%0A%09Node(int d) %7B%0A        data = d;%0A        next = null;%0A    %7D%0A%7D%0A%0Aclass Solution %7B%0A%0A    public static Node last(Node head)%7B%0A        return (head.next == null? head: last(head.next));%0A    %7D%0A    public static  Node insert(Node head,int data) %7B%0A        %0A        if (head == null) %7B%0A            return new Node(data);%0A        %7D else %7B%0A            Node last = last(head);%0A            last.next = new Node(data);%0A            return head;%0A        %7D%0A        %0A    %7D%0A%0A%09public static void display(Node head) %7B%0A        Node start = head;%0A        while(start != null) %7B%0A            System.out.print(start.data + %22 %22);%0A            start = start.next;%0A        %7D%0A    %7D%0A%0A    public static void main(String args%5B%5D) %7B%0A        Scanner sc = new Scanner(System.in);%0A        Node head = null;%0A        int N = sc.nextInt();%0A%0A        while(N-- %3E 0) %7B%0A            int ele = sc.nextInt();%0A            head = insert(head,ele);%0A        %7D%0A        display(head);%0A        sc.close();%0A    %7D%0A%7D%0A

Create Day_15_Linked_List.java