If the queue is empty, both rear and front are initialized with 0.If the queue is not full, then the element can be inserted from the front end by using the below conditions.
#Enqueue and dequeue in java full#
Before implementing the operation, we first have to check whether the queue is full or not.
In this operation, the element is inserted from the front end of the queue. Now, let's understand the operation performed on deque using an example. Checks whether the deque is empty or not.So, in addition to the above operations, following operations are also supported in deque. Through peek operation, we can get the deque's front and rear elements of the deque. We can also perform peek operations in the deque along with the operations listed above. There are the following operations that can be applied on a deque. In output restricted queue, deletion operation can be performed at only one end, while insertion can be performed from both ends. In input restricted queue, insertion operation can be performed at only one end, while deletion can be performed from both ends. The representation of a deque is given as follows - Types of deque
Though the insertion and deletion in a deque can be performed on both ends, it does not follow the FIFO rule. We can say that deque is a generalized version of the queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. The real-world example of a queue is the ticket queue outside a cinema hall, where the person who enters first in the queue gets the ticket first, and the person enters last in the queue gets the ticket at last. Insertion in the queue is done from one end known as the rear end or the tail, whereas the deletion is done from another end known as the front end or the head of the queue. What is a queue?Ī queue is a data structure in which whatever comes first will go out first, and it follows the FIFO (First-In-First-Out) policy. We should first see a brief description of the queue. In this article, we will discuss the double-ended queue or deque. Next → ← prev Deque (or double-ended queue)
0 kommentar(er)
