数据结构10道题（国外英文资料）.docVIP

数据结构10道题（国外英文资料） 1. If two increasing order linear list, according to the element value are stored in the form of singly linked lists, please write the algorithm the two singly linked lists are incorporated into a descending order according to the element value is arranged singly linked lists, and require use of the original two singly linked list of nodes storing singly linked lists after the merge. LinkedList Union (LinkedList la, lb) / / la., lb is leading the node of two the head of a singly linked list pointer, increasing element value according to the sequence arrangement in the list, the algorithm synthesize two lists a descending order according to the elements are arranged singly linked lists. {pa = la - next; Pb = lb - next; / / pa, pb is the work pointer for the linked list, la and lb La - next = null; / / la is the first pointer to the resulting linked list, which initially turns the resulting list into empty While (pa! = null pb! = null) / / when both lists are not empty If (pa - data = pb - data) {r = pa - next; / / the postjunction of pa is stored in r. Pa - next = la- next; / / the pa node is linked to the result table, and the reverse side La - next = pa; Pa = r; / / restore pa to the current comparison node. } The else {r = pb - next; / / pbs successor is temporarily stored in r. Pb - next = la- next; / / the petabyte node is linked to the result table and reversed La - next = pb; Pb = r; / / recovery pb is the current comparison node. } While (pa! = null) {r = pa - next; Pa - next = la- next; La - next = pa; Pa = r; } While (pb! = null) {r = pb - next; Pb - next = la- next; La - next = pb; Pb = r; } } 2 take the lead node and two linear table head pointer ha and hb two sets A and B, respectively, two yuan table in the table are increasing and orderly, please write an algorithm for the AUB and sets A and B, yuan table for the concentrated still keep increasing and orderly, and to use the original node space of A and B LinkedList U