zuloochat.blogg.se - Java queue vs deque

#Java queue vs deque how to#

Pretty easy to grasp if you followed along in the last section. Next, we'll define the isEmpty and isFull functionalities. Like we saw in the images from the previous section, we have set the initial index of the front and back to -1. We are using 3 as the maximum number of items that can be enqueued in the array. We have created our variables and their parameters. We will break this section down by creating each operation and then putting everything together at the end. Time for some code! Queue Implementation in Java When this happens, we will reset their index to -1 (their initial starting point). If we dequeue again at that point, the front arrow will move past the back arrow and then the queue will be considered empty because there is nothing there to delete. In the same order, if we keep removing items, it will get to a point where the front arrow meets the back arrow at the end of the queue. By removed, we do not mean from the array but from the queue – only items from the front position to the back position are part of the queue. This implies that the item at index 0 has been removed. Now the front arrow has moved to index 1.

If we execute it again then it will move to the next number which is 10 and continue in that order for as long as we call it. Remember the first-come-first-out sequence? When we execute the dequeue operation, it will first remove 5 from the queue. So the back arrow followed the items in the order they were added all the way to the last. We will go on and fill up the array so we can see what happens when we dequeue. But now that we have enqueued more items, the back will keep following the last item. Since that was the first and only item then, the front and back sat at that position. The front and back moved together in the last example so that the front could assume the position of the first item. This will continue as we enqueue more items. Next, we will see what happens as we enqueue more itemsĪ second item has been added but only the back moved. The position of the front and back have moved as well. We have inserted (enqueued) our first item – 5. Let us add some items into our array and see what happens. When both positions are at -1, it means the array is empty. The arrows show the position of the front and back of our array. This will enable us move the front and back position properly as values are added. While implementing our code, we are going to set the index of the front and back values of our array to -1. The indices of arrays in most programming languages start from 0.

#Java queue vs deque how to#

Display: Prints all the items in the queue.īefore we see how to implement this with code, you need to understand how the enqueue and dequeue operations work and how they affect the front and back positions.

Front/ Peek: Returns the value of the item in front of the queue without dequeuing (removing) the item.

Dequeue: Removes an item from the front of the queue.

Enqueue: Adds an item from the back of the queue.

The following operations are commonly used in a queue: Whichever structure you go with, always remember that insertion of items happens through the back and deletion through the front. Note that you can reverse the structure of your queue – you can have the front on the right and the back on the left side. There are terms used for the insertion and deletion of items in a queue which we will cover in the next section. The items are inserted through the back and removed through the front. The image shows an array with various cells. Here is a diagram to help you understand better: The back is where the items are inserted and the front is the part of the queue where items are removed/deleted. For the purpose of clarity and consistency, we will stick to using front and back. Structure of a QueueĪ queue is mainly made up of two parts: the front/head and the rear/tail/back. They are helped in the order which they came. Once one individual is attended to, they leave the queue for the next person to be attended to. Using a real world example, we can compare a queue data structure to a queue of individuals standing in line for a service. You can also say that items are removed in the order they were inserted. This implies that the first item to be inserted will be the first to be removed. What Is a Queue?Ī queue is linear data structure that consists of a collection is of items that follow a first-in-first-out sequence. In this article, we will talk about the queue data structure, its operations, and how to implement these operations using an array in Java.