Next: Array Lists: list Up: 3240 Previous: Arrays Contents

Lists: ADT [7]

$\begin{picture}(500,144)(20,660) \thicklines\put( 20,720){\framebox (60,40){}} \... ...120,765){\makebox(0,0)[lb]{\raisebox{0pt}[0pt][0pt]{\twlrm Node}}} \end{picture}$

LIST create_list();
void insert(element_type x, LIST L, position p);
void delete(element_type y, LIST L);
position find(element_type x, LIST L);
int is_empty(LIST L);
int is_last(position p, LIST);
int find_previous(element_type x, LIST L);

After ``create'', maximum size CAN change (DYNAMIC).

To insert ``B'' at position p, fix up TWO pointers.

WORST CASE does not depend on ``n'': O(1)

Applications: dynamic records with many insertions inside the list.

Subsections

- Array Lists: list
- Pointer Lists: Introduction

Ted Billard 2001-10-25