Remove node from a linked list in java -

i'm making dictionary type program linkedlist, cant use linkedlist utility, have create own, can't use of methods, have remove node, , can't life of me figure out. can on paper, in code, either removes before it, or freezes , such. here's have far on delete method:

void delete(string w) {          wordmeaningnode temp = list;         wordmeaningnode current = list;         wordmeaningnode = null;         boolean found = false;         while(current != null && !found)         {             if( current.wordmeaning.gettitle().equals(w))             {                 found = true;                 system.out.println("found it!");             }             else             {                 = current;                 current = current.next;             }          temp = current.next; //this problem starts          back.next = temp;          } } 

and here's how i'm calling it:

string delword = joptionpane.showinputdialog("enter word deleted");                 wordmeaning.delete(delword); 

or maybe i'm not understanding coding concept, teacher wants not "delete" node, redirect node before current, node after current, can me please?

public boolean deletemiddlenode(node middlenode) { //error check: if  (middlenode  ==  null  ||  middlenode.next  ==  null) return false;  /* middlenode x in our example data above, changed hold data of node y: */ middlenode.data = middlenode.next.data;  /*tempnode holds node z if following example above:  */ node tempnode = middlenode.next.next; //delete old node y example above delete(middlenode.next); /*reset pointer new "y" points   z */ middlenode.next = tempnode; }