Is it possible to recursively reverse a list if you can't make a temp list? All I have access to is a pointer to the list. I can traverse the list and print it out in reverse but I can't seem to be able to actually store it in reverse order.
Here is how I print the list in reverse order. Can someone help me with the logic to actually change the data? Thanks.
void AuxPrintReverse(NodeType* myPtr, int i)
if(myPtr != NULL)
if( i == 10)
cout << endl;
cout << myPtr->info << " ";