Delete alternate nodes of a Linked List | GeeksforGeeks

Delete alternate nodes of a Linked List Given a Singly Linked List, starting from the second node delete all alternate nodes of it. For example, if the given linked list is 1->2->3->4->5 then your function should convert it to 1->3->5, and if the given linked list is 1->2->3->4 then convert it to 1->3. Method 1 (Iterative) Keep track of previous of the node to be deleted. First change the next link of previous node and then free the memory allocated for the node. #include #include /* A linked list node */ struct node { int data; struct node *next; };

Read full article from Delete alternate nodes of a Linked List | GeeksforGeeks