Комментарии:
❤
ОтветитьBest Teacher For DSA , Thanks sir 🙏
ОтветитьSir please a course on Linux OS
ОтветитьEasy to understand, awesome course
ОтветитьYou are great teacher
ОтветитьDinesh!!! Excellent tutorial. Real hard work man. Appreciate your efforts. Helped me a lot to understand Data Structure and Algorithms with real time examples.
ОтветитьSir I've a question why private ListNode are you using? Can't we use public
Ответитьthank you.
ОтветитьThat’s a really good explanation
ОтветитьWhat is the use of the constructor stack, by default top is null and length is 0 right
ОтветитьVery helpful series sir.🤗 Sir please make a playlist on collections framework.🙏
ОтветитьIn pop operation won't we have to decrement top?
ОтветитьThanks a lot Dinesh for awesome explanation.
ОтветитьIs this the stack implementation using linked list sir?
Ответитьsir stack element display kese karayenge
ОтветитьVery clear explanation of data structure implementation that i ever saw
Thank you so much sir ❤️
One request please upload video on how to start competitive programming.
can we print stack just like we did in linked list:- while(top!=null)and ..........
ОтветитьWhile using pop it is better to create a temp pointer referring to tops next node and make tops next node to null and then move top to temp. So Java garbage collector will be able to collect the removed object.
ОтветитьWhat difference linkeList araay nd stack
ОтветитьKeep it sir
Ответитьgreat vid
Ответитьwhat is the time complexity of this program?
Ответитьwhat if i write::
private static Listnode top
Wow, learning linked lists was so difficult compared to this.
ОтветитьI spent almost 2 hours looking for LL based implementation of stack. Yours was the only one that has explained in very simple manner. Too impressive way of teaching! Love from California !!
Ответитьvery very clear, awesome job!
ОтветитьThank you very much, I understood a concept.
Ответить