What supports these requirements?

A programmer has an algorithm that requires a java.util.List that provides an efficient
implementation of add(0, object), but does NOT need to support quick random access. What
supports these requirements?

A programmer has an algorithm that requires a java.util.List that provides an efficient
implementation of add(0, object), but does NOT need to support quick random access. What
supports these requirements?

A.
java.util.Queue

B.
java.util.ArrayList

C.
java.util.LinearList

D.
java.util.LinkedList

Show Hint

Leave a Reply 1

Your email address will not be published. Required fields are marked *

Matti

Matti

D is correct, because LinkedList has implemented List and Queue interface.

Reply