Exercise_3.java

//Time Complexity : O(n)
//Space Complexity : O(n)
import java.io.*;
  
// Java program to implement 
// a Singly Linked List
public class Exercise_3 {

    Node head; // head of list

    // Linked list Node.
    // This inner class is made static
    // so that main() can access it
    static class Node {

        int data;
        Node next;

        // Constructor
        Node(int d)
        {
            this.data = d;
        }
    }

    // Method to insert a new node
    public static Exercise_3 insert(Exercise_3 list, int data)
    {
        Node node = new Node(data);
        if(list.head == null) {
            list.head = node;
        } else {
            Node current = list.head;
            while(current.next != null) {
                current = current.next;
            }
            current.next = node;
        }
        return list;
    }

    public static void printList(Exercise_3 list)
    {
        for(Node current = list.head; current != null; current = current.next) {
            System.out.println(current.data);
        }
    }

    // Driver code
    public static void main(String[] args)
    {
        /* Start with the empty list. */
        Exercise_3 list = new Exercise_3();

        //
        // ******INSERTION******
        //

        // Insert the values
        list = insert(list, 1);
        list = insert(list, 2);
        list = insert(list, 3);
        list = insert(list, 4);
        list = insert(list, 5);

        // Print the LinkedList
        printList(list);
    }
}