Delete all the even nodes from a Doubly Linked List

A doubly linked list is a type of linked list where each node contains two pointers, one pointing to the previous node and another pointing to the next node. Deleting all the even nodes from a doubly linked list means removing all the nodes that contain an even value from the list.

Here's an example. Suppose we are inserted the following (8, 1, 4, 9, 5, 3, 12) node in a sequence.

To delete all the even nodes from this list, you would need to traverse the list and check if each node's value is even. If a node's value is even, you would remove that node from the list by updating the pointers of the previous and next nodes to bypass that node. After deleting all the even nodes, the resulting doubly linked list would be:

Note that the order and the structure of the list are preserved, but the even nodes (8, 4, and 12) have been removed.

Program List

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