Given a single linked list with a header node, node structure, assuming that the list gives only the head pointer list. On the premise of not changing the list, please design a possible and efficient algorithm, the penultimate K position on the search list nodes (k is a positive integer). If the search is successful, the data domain algorithm for the output of the node values, and returns 1 otherwise, only to return 0.

Single linked list
..................\Single linked list.txt

• 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．