data structures array representation of queue : overflow and underflow

Published: 15 February 2019
on channel: Techstark

5,552

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 intro...

Best books for coding interview can be found on below link

For USA
https://amzn.to/2RcWCSY

For India
https://amzn.to/2uHxIU3

On this page of the site you can watch the video online data structures array representation of queue : overflow and underflow with a duration of hours minute second in good quality, which was uploaded by the user Techstark 15 February 2019, share the link with friends and acquaintances, this video has already been watched 5,552 times on youtube and it was liked by 78 viewers. Enjoy your viewing!

113,757

2.8K