Introduction - If you have any usage issues, please Google them yourself
1, the node is known to take the lead in junction dynamic single list L Ascending integer value, trial writing an algorithm to the junction point of the value x is inserted into the table L, so that L remains orderly. 2, the design of an algorithm, the inverse is set to take the lead junction dynamic list L. Require the use of a node of the original table space, and require as little time as possible to complete. 3, assuming two increments ordered linear element values in Table A and B are single linked list for storage structures, try to write algorithms to Table A and Table B merge into a descending order linear element values table C, and requires the use of the storage space of the original table C.