西电《数据结构》13春在线作业（West electricity data structure 13 spring online homework）.doc

西电《数据结构》13春在线作业（West electricity data structure 13 spring online homework） 14 spring 13 autumn West Power data structure 13 spring online homework First, radio questions (10 questions, 40 points) 1., the leading link of the single linked list, head is empty, the decision condition is (). A. head==NULL B. head-next==NULL C. head-next==head D. head! =NULL! 2. has six elements, 6, 5, 4, 3, 2, 1 in the order of the stack, which of the following is not a legitimate stack sequence? () A. 543612 B. 453261 C. 346521 D. 234156 3., the efficiency of performing () operations in a list is more efficient than in a sequential table. A. dichotomy search B. quick search C. sequential lookup D. insertion The 4. stack is used in (). A. recursive call B. subroutine call C. expression evaluation D., A, B, C 5., in accordance with the definition of two fork tree, with 3 nodes of the two fork tree, there are () different tree species. A. 3 B. 4 C. 5 D. 6 6. for linear tables stored sequentially, the time complexity of accessing nodes and deleting nodes is (). A. O (n) O (n) B. O (n) O (1) C. O (1) O (n) D. O (1) O (1) 7., compared with single linked lists, one of the advantages of double linked lists is that. A. insert and delete operations are simpler B. can be accessed randomly C. can omit head or footer pointers D. access to adjacent nodes is more flexible 8. insert the new node *s before the *p node of the bidirectional linked list. A. p-prior=s; s-next=p; p-prior-next=s; s-prior=p-prior; B. p-prior=s; p-prior-next=s; s-next=p; s-prior=p-prior; C. s-next=p; s-prior=p-prior; p-prior=s; p-prior-next=s; D. s-next=p; s-prior=p-prior; p-prior-next=s; p-prior=s; 9. if an array of size 6 to achieve circular queue, and the rear and front values were 0 and 3, when an element is deleted from the queue, adding two elements, rear and front respectively? () A. 1 and 5 B. 2 and 4 C. 4 and 2 D. 5 and 1 10. in the following operations, () is the basic operation of an array. A. insertion B. delete C.