How to Perform Operations on Queue | Data Structures

😃❤

sir if array contain single element then according to the program it hit's "queue is empty "'condition rather than displaying the arr[0]th element .

nice explanation sir , i have understood the concept
thank you sir

Queue using linked list?

BETTER APPROCH FOR DELETION :
As mentioned in the above video, after deleting an element we perform shifting operation, this will take O(n) TC.
We can completely get rid of this shifting operation by using mod operator , keep on increasing rare and use mod operator to point to correct location !

Helped a lot

This class is very interesting.

FIX SADD 🤣🤣😂😂

this dude is so fucking amaziiing

add implementation in java sir for queue , stack , ll and its types
thank you

Thankyou so much sir, you make me understand it very clearly

Thank you so much sir for ur perfect explanation

Outstanding Great Explanation :)

Sir meeru kinguuu sir....super anthe ❤️

Thank you sir.. Really outstanding explanation, awaited for more updates.

Nice explanation... again watching it on 1.5x speed, Where is dynamic one tutorial Sir?

Thak you so much sir. Love you.

Sir
First time I learned easily any topic of data structure. I will watch all lecture of data structure.

You are the best sir I have ever seen

Sir this is same like arrays what is advantage of using it

Thanks a lot, sir. I understood the deletion concept easily.
You're the best!

nice video

When rear=-1 and front=-1, it means queue is empty

Ek dil hai sir kitni baar jitoge...
Such a simple explanation of complex concepts 🤘

Thanks a lot

Generally as memory allocation starts from 0 we declare front and rear as -1 right?? But here you are declaring it as 0. May I know why please? please do clarify my doubt.

Extraordinary tutorial Sir. you are the best teacher ever I have been seen

Why we should not move front variable

Sir tell me easily for which data the data structure for sir. For array we use both stack and queue both strutrely ya sir

Great explanation sir 🙏🙏

But when front is 0 rear is 0 then also 1 value is there then why queue is empty in delete function

In a queue deletions Operation we can perform withou shifting elements.

Sir big fan of your 🥺. The way you clear the concept nobody can ......I really wanna meet you sir

DBMS video kudaa chepandi sir

You delete elements from the queue without returning anything? It makes no sense. Why do you even add something if you then delete it? You should implement poll() method. Besides that, nice explanation.

After seeing this I coded in just one go. Such a clean explaintion

Sir the operation which you are doing in for loop of dequeue....i,e que[i]=que[i+1]...it makes it to work like circular queue....
i think we have to increment front aftr deleting an element...if not so then why we have to use circular queue if we can shift the elemnts of queue aftr deleting an elemnt n makin free space for rear...

I struggled to understand the deletion part but finally i got it thanks to God and then you.....

I just watch ads because of you sir

Thank u sir. this help so usefully 🙏🏻♥️

there should be capacity-1

Very helpful thanks alot :)

Camera moves automatically any one noticed??