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 reverse the singly linked list with K nodes. The utility function takes the head node and K value (number of position to reverse the node) and return the head node of reversed list.
Print the first list items: 21->52->33->67->NULL After swap 2 items in the linked list: 52->21->67->33->NULL