计算机专业英语教学课件 郭敏 计算机专业英语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 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