Linked list Implementation

package ds.Linked_List;

public class Node
{
   int data;
   Node next;
 
}

========================================================================

package ds.Linked_List;

public class Runner {

public static void main(String[] args) 

{

Linked_List list = new Linked_List();

list.add(10);

list.add(20);

list.add(30);

list.add(40);

list.add(50);

list.show();

System.out.println("After delting 50");

list.delete(50);

list.show();

System.out.println("add at first - 100");

list.addAtFirst(100);

list.show();

}

}

========================================================================

package ds.Linked_List;

public class Linked_List 

{

Node head;

  void add(int data)

  {

  Node node = new Node();

  node.data=data;

  node.next=null;

  if(head == null)

  {

  head = node;

  }

  else

  {

  Node n = head;

  while(n.next != null)

  {

n = n.next;

  }

  n.next = node;

  }

  

  }

  void show()

  {

  Node n = head;

  while(n.next!= null)

  {

  System.out.println(n.data);

  n = n.next;

  }

  System.out.println(n.data);

  }

  void delete(int data)

  {

  Node n = head;

  Node pre = null;

  //For first nod

  if(n.data == data)

  {

  head = n.next;

  }

  //for middle

  else

  {   

  while(n.data!= data)

  {

  pre = n;

  n = n.next;

  }

  pre.next = n.next;

  n.next = null;

  }

  

  }

  void addAtFirst(int data)

  {

 

  Node node = new Node();

  node.data = data;

  node.next = head;

  head = node;

  

  }

}

========================================================================