Linked-List-Implementation.java

importjava.io.*;

publicclassLinkedList {
Nodehead; 
// LINKED LIST NODE
staticclassNode
 {
intdata;
Nodenext;
// Constructor
Node(intd)
 {
data = d;
next = null;
 }
 }

// Method to insert a new node
publicstaticLinkedListinsert(LinkedListlist, intdata)
 {
Nodenew_node = newNode(data);
// If the Linked List is empty,
// then make the new node as head
if (list.head == null) 
 {
list.head = new_node;
 }
else
 {
// Else traverse till the last node
// and insert the new_node there
Nodelast = list.head;
while (last.next != null) {
last = last.next;
 }
// Insert the new_node at last node
last.next = new_node;
 }
// Return the list by head
returnlist;
 }

// Method to print the LinkedList.
publicstaticvoidprintList(LinkedListlist)
 {
NodecurrNode = list.head;
System.out.print("LinkedList: ");
// Traverse through the LinkedList
while (currNode != null) {
// Print the data at current node
System.out.print(currNode.data + " ");
// Go to next node
currNode = currNode.next;
 }
 }

// Driver code
publicstaticvoidmain(String[] args)
 {
LinkedListlist = newLinkedList();

list = insert(list, 1);
list = insert(list, 2);
list = insert(list, 3);
list = insert(list, 4);
list = insert(list, 5);
list = insert(list, 6);
list = insert(list, 7);
list = insert(list, 8);

printList(list);
 }
}