Delete all occurrences of a given key in a doubly linked list

Delete every node holding a given key from a doubly linked list, keeping the next and previous pointers linked both ways, and return the new head — or null if nothing remains.