//https://www.facebook.com/zawed.akhtar.7923/posts/965508713932178 //Subscribed by MySirG.com import java.util.*; import java.lang.*; class Node { private int data; private Node next; public Node() { data=0; next=null; } public Node(int d,Node n) { data=d; next=n; } public void setData(int d) { data=d; } public void setNext(Node n) { next=n; } public int getData() { return(data); } public Node getNext() { return(next); } } class LinkedList { private int size; private Node start; public LinkedList() { size=0; start=null; } public boolean isEmpty() { if(start==null) return(true); else return(false); } public int getListSize() { return(size); } public void viewList() { Node t; if(isEmpty()) { System.out.println("List is empty"); } else { t=start; for(int i=1;i<=size;i++) { System.out.print(" "+t.getData()); t=t.getNext(); } } System.out.print("\n"); } public void insertAtFirst(int val) { Node n; n=new Node(); n.setData(val); n.setNext(start); start=n; size=size+1; } public void insertAtLast(int val) { Node n,t; n=new Node(); n.setData(val); if(start==null) { start=n; } else { t=start; while(t.getNext()!=null) { t=t.getNext(); } t.setNext(n); } size=size+1; } public void insertAtPos(int val,int pos) { Node n,t; if(pos==1) { insertAtFirst(val); } else if(pos==size+1) { insertAtLast(val); } else if(pos>1 && pos<=size) { n=new Node(val,null); t=start; for(int i=1;isize) System.out.println("Invalid Position"); else if(pos==1) deleteFirst(); else if(pos==size) deleteLast(); else { Node t,t1; t=start; for(int i=1;i