计算机专业英语郭敏计算机专业英语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 Exercises II up accessed removals removed down This implementation stores the list in an array. The Array List has the following properties: ? The position of each element is given by an index from 0 to n-1, where n is the number of elements. ? Given any index, the element with that in