Delete alternate nodes of a Doubly Linked List

A Doubly Linked List is a data structure that consists of nodes, where each node has two pointers, one pointing to the previous node and one pointing to the next node. Deleting alternate nodes of a Doubly Linked List means removing every other node of the list, starting from the second node.

Given a doubly linked list which is contain N nodes. Delete every alternative nodes in this linked list which are exist in Even position. Suppose linked list contain following (1,2,3,6,7,8,9,10) node in a sequence.

Hint In this problem head node are not delete. So the idea are, visit first node of linked list and delete next upcoming nodes. In next time iteration visits of next node and remove upcoming next nodes. Repeating this process until last node of linked list.

Here given code implementation process.

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