Here are the class definitions of Node and List that impleme

Here are the class definitions of Node and List that implement a linked list. class Node private Node next; private int key; Node (Node nxt, int keyValue) constructor Node getNext(); int getKey(); void putNext Node nxt); class List assume the class does not use a dummy Node private Node head; List constructor boolean exists (int ky) returns true if v is in the list void insertAtHeadCint ky) inserts at the beginning of the list void insertAtTail(int ky); inserts at the end of the list int removeFromHead Returns -1 if the list is empty void delete(int ky) delete the element or do nothing if v doesn\'t exist int removesmallest removes the Node containing the smallest key and returns that key. Returns -1 if the list is empty. could be duplicate entries, so remove the first int remove Largest removes the Node containing the largest key and returns that key. Returns 1 if the list is empty. Could be duplicate entries, so remove the first int maxElement() calls the private version, doesn\'t delete the Node int sum calls the private version int length o; calls the private version private int maxElement (Node x); private int sum (Node x); private int length Node x);

Solution

public void delete(int ky, Node x) { Node current = head; while(current!=null&¤t.getNext()!=null) { if(current.getNext().getKey()==ky) { Node toDelete = current.getNext(); current.putNext(toDelete.getNext()); toDelete.putNext(null); return; } } }