data structures array representation of queue : overflow and underflow
Array representation of queue in data structures
Overflow occurs in the array if the REAR = MAX-1 . This means that no element will be inserted now because the queue is already full.
Underflow occurs in the array when FRONT=-1 or FRONT greater than REAR.
when FRONT=-1 that means queue is empty. when FRONT greater than REAR means all elements have been deleted in the queue
data structures playlist :
• infix prefix postfix data structures ...
Best books for coding interview can be found on below link
For USA
https://amzn.to/2RcWCSY
For India
https://amzn.to/2uHxIU3
![OSU! [supercell - Hero Kowari's Insane] 4.42 FC S](https://images.videosashka.com/watch/l4DQHYtqzqY)
