Chapter 8, Problem 14CRP

Explanation of Solution

Algorithm for printing a linked list in reverse order using a stack:

The algorithm for printing a linked list in reverse order using a stack is shown below:

Procedure ReverseLinkedListPrint(List)

CurrentPtr ← Head pointer of list

While (CurrentPtr is not equal to NULL) do

Push the entry pointed to by CurrentPtr on to stack;

CurrentPtr ← Value of next pointer in entry pointed to by CurrentPtr.

While (Stack is not empty) do

Print the top value in the stack

Pop an entry from the stack.

Algorithm explanation:

• The given algorithm is used to print a linked list in reverse order using a stack.
• From the above algorithm, first define the procedure “ReverseLinkedListPrint” with argument “List”...

Explanation of Solution

Recursive function for printing the linked list in reverse order:

The recursive function for printing the linked list in reverse order is shown below:

Function ReverseLinkedListPrint(List)

If the head pointer of List is not NULL, then

Recursively call the function "ReverseLinkedListPrint" with the first entry of given List;

Print the first entry in List

Function Explanation:

• The given function is used to print the linked list in reverse order using recursive function.
• First define the function “ReverseLinkedListPrint”...