Complete playlist of Data Structure Using Java : https://goo.gl/3eQAYB

Queue is a First-In-First-Out (FIFO) data structure.
In Queue the first element added to the queue will be the first one to be removed.
This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed.
Adding element in Queue is called EnQueue and removing element is called DeQueue.
Often a peek or front operation is also entered, returning the value of the front element without dequeuing it.

In this video we will see :
- Size
- isEmpty
- isFull
- EnQueue
- DeQueue
- Implement isEmpty- check if Queue is empty
- Implement isFull- check if Queue is full


Editing Monitors :
https://amzn.to/2RfKWgL
https://amzn.to/2Q665JW
https://amzn.to/2OUP21a.


Check out our website: http://www.telusko.com

Follow Telusko on Twitter: https://twitter.com/navinreddy20

Follow on Facebook:
Telusko : https://www.facebook.com/teluskolearn...
Navin Reddy : https://www.facebook.com/navintelusko

Follow Navin Reddy on Instagram: https://www.instagram.com/navinreddy20

Subscribe to our other channel:
Navin Reddy : https://www.youtube.com/channel/UCxmk...
Telusko Hindi :
https://www.youtube.com/channel/UCitz...


Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20
http://www.telusko.com/contactus