If something is worth doing once, it's worth building a tool to do it. Anonymous
The singly linked list contains the sequence of nodes which each node contains data and link to the next node. Write a program to delete alternative nodes from the singly linked list. The utility function takes head node of linked list and returns the head node after deleting the alternative node from linked list.
Print the list of items: 21->52->33->21->67->NULL Print the list of items after remove duplicate: 21->33->67->NULL