Q:

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?

0

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?


  1. java.util.Queue
  2. java.util.ArrayList
  3. java.util.LinkedList

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:'

java.util.LinkedList

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Similar questions


need a help?


find thousands of online teachers now