#13 Queue Implementation using Java Part 1 | EnQueue

preview_player
Показать описание

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 :
- What is Queue
- EnQueue
- DeQueue
- Insert
- Remove
- Size
- isEmpty
- What is Front
- What is Rear
- Implement Queue operation- EnQueue with array

Editing Monitors :

Follow on Facebook:

Subscribe to our other channel:
Telusko Hindi :

Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20
Рекомендации по теме
Комментарии
Автор

Your are a good teacher. I've seen a lot of tutorialsl about queue BUT this one is way better. THANK YOU SO MUCH SIR

musicalyrico
Автор

Sir, I am very thankful to you to upload and give this beautiful explanation.

abhiraj
Автор

So helpful and nice explanation. thank you a lot

MrAbbasalrassam
Автор

Sir from where i can learn complete DS in java
Anyone can suggest simplest way

gtechgyan
Автор

enqueue should also have a condition, if rear == 5, throw exception that overflow has occured

pranavkapoor
Автор

Sir, make a code and plz explain it on circular queues implementation using linked list in java

rupeshsharma
Автор

I don't get this, you never mentioned the size initially, except when creating the queue like [5], then from where does it start

SajanKumar-ms
Автор

Nice explanation.we want this type of detailed, in-depth and easy data structures, algorithms analysis & design principles complete videos series..many thanks.

chinmaydas
Автор

Hahaahah "very famous exception" xDDD

nikolapetrovic
Автор

these are much more intresting in java to code rather than C language.

digitalnomadg
Автор

Excellent explanation. I've seen a few but none as good as this. Thank you.

troytaylor
Автор

A Queue is an interface, which means you cannot construct a Queue directly..i am confused, can someone help?

georgeem
Автор

You can simply use a linked list which is way cleaner and safe for this implementation.

masabzesabzim
Автор

Better than my lecture.. He makes things look easy

tradermigel
Автор

By which programming language can we create Jarvis ? And windows os ? Please tell me
You know about jarvis na ?

srijansinha
Автор

Please make videos on circular arrays, doubly linked list and all other data structures.

aayushjoshi
Автор

I get an error for q.show();
it's highlighted with red underline and won't run!!

pawandeepsingh
Автор

rear and size have the same value. it's a waste to have both variables in this case.

Автор

*Sir Please why don't make Videos Playlist on C Programming language Series?*

mrzaidivlogs
Автор

sir, can you teach me how to add/enQueue in the middle position/ or example I want to add in an position every position.

faizzz__