Question: use RERCURSION to finish this in c++ void printReverse (NodePtr tmpPtr); // Task: Print au the values in a linked list in reverse order //
void printReverse (NodePtr tmpPtr); // Task: Print au the values in a linked list in reverse order // Pre: tmpPtr points to the first node of the list, or it is nullptr if /I the list is empty /I Post: the values of all nodes in the linked list are printed in reverse 6 // order, one per line, and the linked list is unchanged
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
