41
Lists
•
Insertion and deletion have constant time
complexity at all positions.
•
No random access.
•
The list container is monolithic,
not
polylithic
(a la LISP); there is no structure sharing.
•
Lists are often useful for implementing a
queue.