make it point to its previous node we have to make sure that the last node is not the lost node so we'll have some temp nodewhich looks like the head node pointing to the last node nowwe shall make all left side nodes point to their previous nodes one by one except the node (first nodepointed by the head nodeall nodes should point to their predecessormaking them their new successor the first node will point to null we'll make the head node point to the new first node by using the temp node the linked list is now reversed program#include #include #include #include struct node int dataint keystruct node *next}