CODEWITHSUNDEEP
java
There is nothing we can do
There is nothing we can do

Reputation: 24685

What to choose to implement deque?

What would you rather choose to implement deque: HashSet or LinkedList. And could you state cons and pros for both please? Thank you.

Upvotes: 0

Views: 861

Answers (3)

matsev
matsev

Reputation: 33779

HashSet is not an alternative, because a set does not record the order in which the element was added. Additionally, a set does not allow the same element to be added more than once.

LinkedList is a better option or why not using an existing Deque implementation?

Upvotes: 1

Andrey
Andrey

Reputation: 60065

Of course LinkedList. All Dequeue operations there are implemented strictly as O(1) and no excessive memory is used.

Upvotes: 3

Adamski
Adamski

Reputation: 54705

A HashSet is not a Deque so you would have to use a LinkedList (which does implement Deque). The reason behind this is that HashSet is not an ordered data structure, and hence cannot be used as a queue.

For thread-safe blocking implementations of Deque consider LinkedBlockingDeque or ArrayDeque.

Upvotes: 3

Related Questions