Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it. Brian W. Kernighan

Delete alternate nodes

Language Java | Level Intermediate | Category Data structure | September 6, 2015 12:05 am

Data structure Description

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



No comments available!

Please login to add comments.