In java, for a doubly linked list, how can I use this search to remove a certain node

public String search(String key) {

Node current = head;

while (current.element != key) {

current = current.next;

if (current == null)

return "Not found!";

if (current == head)

head = current.next;

else

current.prev.next = current.next;

if (current == tail)

tail = current.prev;

else

current.next.prev = current.prev;

}

return "Found!";

}