1. Has been to the head of a singly linked list pointer to H, each node of the data domain data as an integer, pointer field for the next, and design an algorithm inserta (H, d), implemented:
If already in the list for H D, then output "existing", and then return; Otherwise, insert d at the end of the list,

CodePudding user response:

This topic just meet, most traversal can again, if found, the value of the intermediate output directly d otherwise, automatically by the end of the list, insert the d