public void reverse() { Node current = first; first = null; while (current != null) { Node save = current; current = current.next; save.next = first; first = save; } }
public Node delete(int val) { Node current = first; Node previous = first; while (current.item != val) { if (current.next == null) return null; else { previous = current; current = current.next; } } if (current == first) first = first.next; else previous.next = current.next; return current; }
public void insert(int val)//inserts at beginning of list { Node newNode = new Node(val); newNode.next = first; first = newNode; }
public Node delete()//deletes at beginning of list { Node temp = first; first = first.next; return temp; }
public LinkedList() { first = null; }