Need a little help please...

Which data structure would you most likely see in a non-recursive implementation of a recursive algorithm? A typical implementation of recursion involves the use of a stack. One of the times we may see a non-recursive implementation of a recursive algorithm would be using the RevPrint. This is accomplished by keeping track of the pointer to each node until we reach the end of the list which is when the pointer that is traversing the list reached the end or NULL and then the data member would be printed into that last node, and the process would be repeated in revers until we reach the first element in the list.

Discuss how you might go about implementing this process and any other programming tools that might be needed to complete the implementation.