If you do not need efficient random access but need to efficiently move sequentially through the list,then use the _____________ class. A)Vector B)LinkedList C)HashSet D)TreeSet

Question

If you do not need efficient random access but need to efficiently move sequentially through the list,then use the _____________ class. A)Vector< T > B)LinkedList< T > C)HashSet< T > D)TreeSet< T >

Quizplus · Accepted Answer

LinkedList< T > is the best choice if sequential traversal is the primary operation, as it provides efficient insertion and deletion at any position in the list compared to Vector< T > which costs linear time for insertion and deletion at non-end positions. HashSet< T > and TreeSet< T > are not appropriate choices as they are mainly used for checking membership of an element and not for sequential traversal.

If You Do Not Need Efficient Random Access but Need