I am really trying to get into List-Implementation.
Everything I wrote works fine except the "delete Element at Position" funktion.
With the iterative Implementation there is no problem, everything works, but I want to do a recursive Version.
This is the Task:
Invent an algorithm which becomes a doubly linked list (L) and a Position (n) and deletes the Element at the given Position recursively.
I really need your help. Hope you have a solution.