public Node<E> remove (int index)
i need to recursively implement this method. Node<E> nodes contain two fields, next (a reference to the next node in the linked list) and element (a reference to the data it contains)
public E element; public Node<E> next;
Do not worry about the checking for element not found (there is a call to another method when it gets to the end of the list as the end of the list is a different type of node with its own remove method, EmptyNode).
I can recursively traverse through the list to the node i need to delete, but once i get there, i dont really understand what i need to return. I am trying to update the next field of the PREVIOUS node to the next field of the current node, and then return the current node all the way through the recursive calls.
Any help would be greatly appreciated.