Write a ‘C’ function to reverse a singly linked list by traversing it only once

a) Write a ‘C’ function to reverse a singly linked list by traversing it only once.
b) Write a ‘C’ function to remove those nodes of a singly linked list which have duplicate data. Assume that the linked list is already in ascending order.

Leave a Reply