第三章 链表 基本题（国外英文资料）.doc

第三章 链表 基本题（国外英文资料） Chapter iii linked list JiBenTi 3.2.1 individual choice questions A single linked table head that does not take the lead is an empty decision condition A: its a good thing to do. = NULL The one-linked list head, which leads the reception points, is null A: its a good thing to do. = NULL Non-empty loop single-linked list head of the head (directed by p) satisfies A.p- head = NULL B.p = NULL c.p- next = head D.p = head The operation of inserting the s node in the loop double linked list p is P minus right = s; S - left = p; P- right - lefe = s; Lets say s minus right. B.p- right = s; P- right - left = s; S - lefe = p; Lets say s minus right. C.s- lefe = p; Lets say s minus right. P - right = s; P- right - left = s; D.s- left = p; Lets say s minus right. P- right - left = s; P - right = s; In a single linked list, q is known as the prodrome of node p, which is performed if the node S is inserted between q and p (1) a.s- next = p- next. P - next = s; B.p- next = s- next. S - next = p; C.q-, next = s; S - next = p; D. p - , next = s; S - next = q; In a single linked list, if the node of the p is not the last node, insert the s reference node after p and execute A.s - next = p; P - next = s; B.s- next = p- next; P - next = s; C.s- next = p- next. P = s; D.p - next = s; S - next = p; In a single linked table, if the subsequent nodes of the node of the p are deleted, the execution is performed P - next = p- next - next. P. = p - next; P - next = p- next - next. C.p- next = p- next D.p - next - next Suppose the double list node is the following: Typedef struct linknode {int data; / * data domain * / Struct linknode * llink; / * llink is the pointer field to the previous drive node Struct linknode * rlink; / * rlink is a pointer field to the following node } bnode Algorithm is given below referred to in paragraph is to get a new nodes as a two-way referred to in the list is not empty the precursors of node is inserted into the d