Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

deletion is at cursor; A is O(n),L is O(1)
6.4 List ADTs and the Collections Framework
In this section, we discuss general list ADTs, which combine methods of the deque,
array list, and/or node list ADTs. Before describing such ADTs, we mention a larger
context in which they exist.
6.4.1 The Java Collections Framework
Java provides a package of data structure interfaces and classes, which together
define the Java Collections Framework. This package, java.util, includes
versions of several of the data structures discussed in this book, some of which we
have already discussed and others of which we discuss in the remainder of this
book. In particular, the java.util package includes the following interfaces:
Collection:
A general interface for any data structure that contains a collection of
elements. It extends java.lang.Iterable; hence, it includes an
iterator() method, which returns an iterator of the elements in this
collection.
Iterator:
An interface for the simple iterator ADT.
List:
An interface extending Collection to include the array list ADT. It also
includes a method listIterator for returning a ListIterator object for
this list.
ListIterator:
An iterator interface that provides both forward and backward traversal
over a list, as well as cursor-based update methods.
Map:
An interface for mapping keys to values. This concept and interface are
discussed in Section 9.1.
Queue:
351