SinglyLinkedList

Adding Node at front:

Node first = null;
   //Node start = null;
public void addNode(int nData){
Node newNode = new Node((int)nData);
if(first==null){
first = newNode;
}else{
   newNode.next = first;
   first = newNode;

Add Node at Last:

Node current = first; while (current.next != null) {
 current = current.next; } current.next = newNode;

Add Node at an index

public void addNodeAt(int nData,int index){ //if(check for list length) Node newNode = new Node(nData); Node current = first; int count = 0; while (current!=null && count!=index) { current = current.next; count++; } newNode.next = current.next; current.next = newNode; }

Delete Node at Last:

Node current = first; Node forward = first.next; if (first == null) return; else { while (forward.next != null) { current = current.next; forward = forward.next; } current.next = null; }

Delete Node at particular Index:

public Node delNode(int nData) { Node previous = first; Node current = first.next; while (current.nData != nData) { current = current.next; previous = previous.next; } if (current.next == null) previous.next = null; previous.next = current.next; return current; }

Delete LinkedList

public void deleteList(){ first = null; }