Remove duplicates from a sorted doubly linked list

Assume that given a sorted doubly linked list which are exist repeated values. Find and delete this duplicates nodes which is exist more than once.

Suppose we are inserted the following ( 5, 5, 7, 9, 9, 11, 45, 45) node in a sequence.

Here given code implementation process.

1) Remove duplicates from sorted doubly linked list in java 2) Remove duplicates from sorted doubly linked list in c++ 3) Remove duplicates from sorted doubly linked list in c 4) Remove duplicates from sorted doubly linked list in c# 5) Remove duplicates from sorted doubly linked list in php 6) Remove duplicates from sorted doubly linked list in python 7) Remove duplicates from sorted doubly linked list in ruby 8) Remove duplicates from sorted doubly linked list in scala 9) Remove duplicates from sorted doubly linked list in swift 10) Remove duplicates from sorted doubly linked list in kotlin 11) Remove duplicates from sorted doubly linked list in typescript 12) Remove duplicates from sorted doubly linked list in vb.net 13) Remove duplicates from sorted doubly linked list in golang 14) Remove duplicates from sorted doubly linked list in node js