1.
A special case often occurs for insertion and deletion routines when a list is
________.
2.
Assuming a copy takes longer than a comparison, is it faster to delete an item
with a certain key from a linked list or from an unsorted array?
3.
How many times would you need to traverse a singly linked list to delete the
item with the largest key?
4.
Of the lists discussed in this chapter, which one would be best for
implementing a queue?
5.
Which of the following is
not
true? Iterators would be useful if you wanted to
a.
do an insertion sort on a linked list.
b.
insert a new link at the beginning of a list.
c.
swap two links at arbitrary locations.
d.
delete all links with a certain key value.