计算机专业英语 郭敏 计算机专业英语Unit6.pptVIP

Unit 6 Section 2 Passage A algorithm data structure character table list stack queue tree array node LIFO tail Unit 6 Section 2 Passage B linear table Integer direct precursor element direct successor element head rear insertion deletion sequence form chain form pointer reflection Unit 6 Section 2 Passage B The logic relationship between data elements is instructed by pointer of a node. In other words, pointer is a reflection of logical relationship between data elements. Unlike sequence list, the storage location of each element can not be obtained simply by the formula, while it is included into the information of its direct predecessor node. So as to obtain a certain element, we must detect each node from the head one by one through the pointer. And it shows that link list is a non-random access storage structure. How to implement insertion and deletion in link list? Imagine we will insert an element x between a and b, a node with data field value of x is created firstly, and then insert this node into link list. According to the logical definition of insertion, the value of pointer field in node must be altered to refer to node x, and that of node x also be assigned to point to node b. Thus, the logical verification of node a, b and x can be achieved. Unit 6 Section 2 Passage B Contrarily, if we want to delete node b that between node a and c in the link list, what we need is only to assign address of node c to pointer field of node a. After deleting, node c become the direct successor of node a. To sum up, it only need to modify the pointer value without having to move elements, when we inserting or deleting an element to or from the link list. In view of the advantage of link list in the rational utilization of space and in easy realization of insertion and deletion, it is the preferred storage structure of linear table. Unit 6 Section 2 Passage B Exercises I 1. ( ) Linear table can be stored in computer either in sequence form or in chain form. 2. ( ) Li