Hot Topics
Data Structure
Dequeue
Dequeue stands for doubly ended queue which is a version of normal queue but here we can insert or delete elements from both front and end of the queue.
Operations on Dequeue
pushFront() – to add element to the front of queue
pushRear() – to add element at the rear of queue or after the last added element.
popFront() – deletes element from front of queue
popRear() – deletes element from the rear of queue
getFront() – gets the front element of queue
getRear() – gets the rear element of queue
isEmpty() – checks if the queue is empty
isFull() – checks if the queue is full
Applications of Dequeue
Used for scheduling algorithms
We can perform both FIFO for queue and LIFO for stack operations using it
Clockwise and anti-clockwise operations can be performed in O(1) time using dequeue
Popular Category
Hot Topics
Go through our study material. Your Job is awaiting.