Комментарии:
😃❤
Ответить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??
Ответить