TraverseOfLinkedList.java

class LinkedList{
    static Node head;
     static class Node{
        int data;
        Node next;
        public Node(int data){
            this.data = data;
            this.next = null;
        }
    }
    //if the list is empty;
    public static void push(int Data) {
        Node temp = head;
        Node new_node = new Node(Data);
        if (head == null) {
            head = new_node;
            head.next = null;
        } else {
            while (temp.next != null) {

                temp = temp.next;

            }
            temp.next = new_node;
            new_node.next=null;
        }
    }
    public static void printList(){
         Node current = head;
        while(current!=null){
            System.out.println(current.data+" ");
            current=current.next;
        }
    }
    public static void main(String[] args) {
    LinkedList n = new LinkedList();
            push(56);
            push(15);
            push(485);
            printList();

    }
}