Java Essentials - The queue in java

The Q in Java. So we know that Q is one data structure which supports the first in, first out and the last in, last out data structure

Q is a subclass of the class that is the link list. So let us go for some further discussion on this queue

The Q in Java collection. The Q is a subclass of the link list class. To insert element into Q, we can use

the add method of the linkless class and also to remove or delete some element from the queue

we can use the remove method accordingly but q is also having a separate some dedicated methods

defined within the q class so q also has the method that is a pick method it is used to return

the first element of the q not deleting that one so these are the different concept we have

shared so now let us go for one practical demonstration for your easy understanding In this program we have defined one object my Q This object is defined under the interface

You can find that in the help we are finding this one as interface. There is a Java.tutil.cue

So Java. .util is a package name and Q is the respective interface

And this queue has got instantiated using is equal to new link list, a constructor here

so how to add members to this Q object that is a my Q and this my Q will be holding integer that is a wrapper class objects as its member so to add that new elements we are going to go for new items we are going to go for this method add so using the method add we can add new items to this my queue that is a Q interface object so new my queue dot add 10 my queue dot add 40 my Q dot add 50 in this way

we have added five such elements we know that cube is a data structure which supports first in first out or last in last out that means we are we can think that this 10 is at the front end of the queue and 50

will be found at the rear end of the queue so now if I want to print the number of

elements we're having number of items we are having within this my queue there is a

queue interface object the method is size with the help of size you can print it

how many items you have added here five items so we are expecting that my q

size will print five here yes the skew size is five now we are going to pick

the first element that means in this case the first element will be red but it

will not get deleted from the queue and you can find that here we are getting

this first element as 10 because 10 is at the front end and 50 is at the rear

end so the first element will be at the front end so the value is 10 but the 10 has

not got deleted from the my queue object it is still there the item is still

there now using this while loop so my q dot is empty so when the queue will become empty then is empty will return true then not of true will become false then you can come out from this while

but when this is empty will be returning false that means the queue is still

having some items then not of false will become true the while will continue

doing the iteration so how to remove elements from the queue that is a my cue

dot remove so remove is the method with help of which you can eliminate

the element which will be found at that at the front end of the cube so the popped item is is this one also in case of pop type also item we can go for a removed item that will be better here

so the removed item is this one so let me go for the execution you can find that the remove item will be 10 then 40 then 30 then 20 then 20 then the

rearest object that is a rear most object there is a 50 is getting printed here in this way in this particular demonstration we have discussed

us how to define and deal with Q objects. Thanks for watching this video