Take the lead junction point of the singly-linked list h prior to the i-th data elements insert a data element x, single linked list, you first need to find the first i-1 junction point and indicated pointer p, and then apply for a pointer s instructions the knot point of space, and set the x its data field values, last modified i-1 nodes, and x node pointer to the i-th node, delete the i-th to take the lead in a single linked list node h node, we must first count and looking to the i-th node pointer p points to its precursor i-1 nodes, then delete the i-th node and release deleted node space.

linear-list.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．