Like I said, I didn't get anything even after I thought about 2 hrs. So could anyone can show me a example or some specific code stuff? I think only the idea doesn't work for me, the best way is learn from examples!
write a void function that takes a linked list of int and reserves the order of its nodes. The function will have one call-by-reference parameter that is a pointer to the head of the list.After the function is called, this pointer will point to the head of a linked list that has the same nodes as the original one, but in the reserve order they had in the original list. Note that your function will neither create or delete a node. Please place a test program for it.