Geek Answers Handbook

Queue vs Dequeue in java

What is the difference between the two? I know that

The queue is designed to place elements at the end of the queue and elements removed from the beginning of the queue. Where Dequeue represents the queue, where you can insert and remove elements from both ends of the queue.

But which is more efficient?

Plus what's the difference between the two? because I have a little knowledge about them, which I said above, but I would like to know more about them. Will be appreciated.

+15
java data-structures queue deque
source share
2 answers

Deque is short for "two-way queue." In a normal queue, you add things to one end and extract them from the other. With a two-way queue, you can add things from any end and take them from either end. This makes it a little more versatile; for example, you can use it as a stack if you want.

In terms of efficiency, it really depends on the implementation. But generally speaking, you do not expect deque to exceed the queue, because a (one-way) queue can be implemented in such a way as to prevent the addition or removal of objects at the "wrong" end. Whereas any deque implementation will also work as a queue implementation.

+21
source share

Deque and queue are abstract data types that can be implemented in different ways. To talk about performance, you need to specify which implementations you want to compare, and which operations that interest you. Even better, do the test yourself with the workload of your application and in the environment you are going to use (hardware, operating system, JVM version).

Since each deque is also a queue, you can say that deques can be no worse than queues.

+4
source share

More articles:


All Articles