The easiest way to think of traversing the list again, using an auxiliary pointer, store the current pointer to traverse the course of the next element, and then reverse the current node pointer element, the use of pointers is stored to the rear to traverse. Source code is as follows:

c.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．