Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

​

Diving Deeper – Circular Queues and Deques

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 2 years ago

We can do the following to check whether the queue is full or not when it is not empty:

if ((front == (rear + 1) % size)) { 
   System.out.println("Queue is Full"); 
}

This condition unambiguously handles the wrap-around behaviour of the circular queue and ensures accurate detection of the full condition in all scenarios.

Show 1 reply
A

Anonymous

· 3 years ago

We really need more examples of circular queues and dequeues.

Especially with these data structures being implemented using linked lists rather than arrays.

Reading Progress

0%

Vote for new content