Java Reference
In-Depth Information
3. Visiting the elements of a linked list in sequential order is efficient, but random
access is not.
4. You use a list iterator to access elements inside a linked list.
5. Implementing operations that modify a linked list is challengingȌyou need to
make sure that you update all node references correctly.
6. An abstract data type defines the fundamental operations on the data but does
not specify an implementation.
7. An abstract list is an ordered sequence of items that can be traversed
sequentially and that allows for insertion and removal of elements at any
position.
690
691
8. An abstract array is an ordered sequence of items with random access via an
integer index.
9. A stack is a collection of items with Ȓlast in first outȓ retrieval.
10. A queue is a collection of items with Ȓfirst in first outȓ retrieval.
CLASSES, OBJECTS, AND METHODS INTRODUCED IN THIS
CHAPTER
java.util.Collection<E>
add
contains
iterator
remove
size
java. util.Iterator<E>
hasNext
next
remove
java.util.LinkedList<E>
addfirst
addLast
getfirst
getLast
removefirst
