What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1

Understand the working of a Queue data structure and all its operations.
Definition : Queue is a linear data structure which operates in a First IN First OUT or Last IN Last OUT.
It is named queue as it behaves like a real-world queue, for example – queue(line) of cars in a single lane, queue of people waiting at food counter etc.
Queue is an abstract data type with a bounded (predefined) capacity.
It is a simple data structure that allows adding and removing elements in a particular order.
The order is FIFO(First IN First OUT) or LILO(Last In Last Out).
Following are the standard operations of Queue DS -
1. Enqueue
2. Dequeue
3. isFull
4. isEmpty
5. count
---------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------
Support Simple Snippets by Donations -
---------------------------------------------------------------------------------------------
Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

#queue #queuedatastructure #datastructures #queueds #queueoperations

[SimpleSnippets]

Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌

[Rohit-siuf]

bro i can understand very nicely each and every topic...thank u from my bottom of my heart.

[ujjawalsharma]

Found this channel today, Your work is truly appreciable brother. 🔥🤘

[chayanbarman]

for me this is the Best Data Structure playlist ...in youtube.. easily understandable and the visual representation is too good ...

[aliza]

the Indian guy helping me out more than my uni teachers, keeping going thanks <3

[NikitaSharma-bsgg]

Your videos are so well presented and so much clarity of concepts - thanks for sharing really amazing

[prakritiagrawal]

I was having so much problem as to where will I be able to learn all the DS, but you really made it up very easy, thank you very much sir ..whole heartedly thank you very much

[vidhioswal]

Thank you for explaining it in such a detailed manner!

[JohnWickXD]

You are the only one who took time to explain it first rather than jumping to code!
Thanks alot...Your videos mean so much to us❣

[conormcgregor]

bro your videos are short and to the point. Really helpful

[hemanthsai]

best playlist ever. Too much underrated. You deserve more subs

[patelvraj]

best in world
i watched it before and second time i did't get this type of describe in any other video so keep it up buddy too good

[zainabbohra]

After watching your videos, now i really think, i will implement it 😎🤩, thanks from bottom of my heart

[waseemtarar]

amazing bro thanks by heart .now i think i am able to learn DSA

[chetnagreesan]

I know I'm commenting on almost every video... But You outdo yourself everytime!!
Thank you very much!!!

[_AnanyaVerma]

It was really helpfull i understood every

[crypticwhispers]

Thanks a lot for providing this amazing content that's also for free.... It means a lot For the first time in my 2 years of college... I have understood what queue is and how it's actually implemented.... Thanks a lot.

[AJRobinson]

Fantastic video! I have one question. After performing out last dequeue operation, the last read value is not cleared out. I added a arr[front] = 0; in my dequeue "else if" so that when I read the last queued item (when front == rear), that value is read, then cleared. Does this track?

[yeementhvirutkar]

Happy to learn from u.keep doing this for ever😉

[ArchitStark]

You make it so easy bro, I am a non Comp Sci guy and its still so easy for me to get this...thankss!!!