- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2014-11-21
- Downloads:
- 0 Times
- Uploaded by:
- 陈默
Description: 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.
To Search:
File list (Check if you may need any files):
Single linked list
..................\Single linked list.txt
Download