What are the trade-offs in space complexity between an ArrayList and a
LinkedList?
The linked implementation requires more space per object to be
inserted in the list simply because of the space allocated for the
What are the trade-offs in time complexity between an ArrayList and a
LinkedList?
The major difference between the two is access to a particular
What is the time complexity of the contains operation and the find operation
for both implementations?
What effect would it have if the LinkedList implementation were to use a
singly linked list instead of a doubly linked list?
Why is the time to increase the capacity of the array on an add operation
considered negligible for the ArrayList implementation?
What is an iterator and why is it useful for ADTs?
An iterator is an object that provides a means of stepping through
the elements of a collection one at a time.