Just remember: you’re not a ‘dummy,’ no matter what those computer books claim. The real dummies are the people who–though technically expert–couldn’t design hardware and software that’s usable by normal consumers if their lives depended upon it. Walter Mossberg

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.


Output

   					 

Print the list of items: 21->52->33->21->67->NULL
Print the list of items after remove duplicate: 21->33->67->NULL

				    

Comments


No comments available!

Please login to add comments.