Write a simple C++ program to delete each alternate node of a singly linked list. For Example: 1->2->3->4->5->6->7->8->NULL should be restructured to 1->3->5->7->NULL Note: use DSA concepts with...

Write a simple C++ program to delete each alternate node of a singly linked list.
For Example: 1->2->3->4->5->6->7->8->NULL
should be restructured to
1->3->5->7->NULL

Note: use DSA concepts with singly linked list.