in Java trying to figure out how to remove a node in a linked list using recursion only, I think my issue is not having a way for the list to move the other nodes down once one is removed.

public void remove(int key) { remove(key, head); } private Node remove(int key, Node h) { if(key == h.data) { if(h.link == null) h = null; h = h.link; } return remove(key, h.link); }