Search:

Please post what you came up with for the remove method

Its actually even easier than this.

1. Make sure the index is in bounds
2. Traverse to the node we want to delete (nodeToRemove)
3. Node<T> previous = nodeToRemove.getPrevious(); Node<T> next =...

Your remove code is still wrong.... There is unnecessary code, and you are making it overly complex, which leads to errors.

What you have now is very hard to follow.

Try starting over. Only...

In your remove method: you need to set the previous of the node after the one you delete. You are updating the next for the node before the node you delete, but you need to do both since it is...