Chapter 8, Problem 13CRP

Explanation of Solution

Function for reversing the order of a linked list:

//function for reversing the order of a linked list

//void Reverselist(Linkedlist list)

{

//creating pointers to the linked list

nodeType*current,*temp,*first;

//assign the head position to current node

current=head;

//make the first pointer to NULL

first=NULL;

//change the order of the list by using the while loop

while(current!=NULL)

{

first=temp;

current=first;

current=current->link;

}

//assign the head to the first pointer

first=head;

}

Explanation:

• Suppose *current, *first and *temp be any three points that point to the nodes in a list.
• The address of the head node is stored by the current pointer.

  current=head;

• The NULL is initialized by the first pointer...