Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - ruclips.net/p/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over RUclips with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)
Thank you Sir, I really appreciate this video (and many other of your videos, too), and you step-by-step don't-rush approach is just great. Although I can understand the logic, my problem is that I often forget a couple of key pieces in the algorithms. The animation really helps me memorizing them. Haven't checked out all your videos yet but I hope you can make more animation videos on more advanced algorithms such as Kosaraju or Aho-Corasick, etc.
Good learning experience so far. DSA has always been mysterious and tough for me. Looks like I will be able to do something about dsa after watching these videos.
Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.
Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.
![Kodak Black - Catch Fire [Official Music Video]](http://i.ytimg.com/vi/A4ch-olIuZo/mqdefault.jpg)
Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - ruclips.net/p/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d
Thanks a lot for the clean explanation, it was a tough one, would it be possible to explain more BinaryTree examples from Leetcode?
@@kananmehdizade5171 sure
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over RUclips with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)
Thanks !!!
Thanks for the great explanation and providing reasoning behind why we are doing that.
Thank you Sir, I really appreciate this video (and many other of your videos, too), and you step-by-step don't-rush approach is just great. Although I can understand the logic, my problem is that I often forget a couple of key pieces in the algorithms. The animation really helps me memorizing them. Haven't checked out all your videos yet but I hope you can make more animation videos on more advanced algorithms such as Kosaraju or Aho-Corasick, etc.
Will add after pending topics !!!
Good learning experience so far. DSA has always been mysterious and tough for me. Looks like I will be able to do something about dsa after watching these videos.
Thanks for such kind words !!!
Nice explanation sir. I learned how to traverse binary tree through your video series. Many thanks.
Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.
@@itsdineshvaryani Yes sir. I have passed on to my colleagues
Thank you so much for the support !!!
thank so much for the explanation.what is the difference between pop and pull.and should the pull method be used in a stack instead of the pop.
Java stack usually has pop method ... use that !!!
understanding this logic was quite tough, was it a hard level problem and do we need to make such logics and code while in dsa???
Absolutely !!!
thanks a lot ... Love from Bangladesh
welcome !!!
Great content. Thank you Sir
Welcome. I would request you to please share the course with your friends and colleagues. It would help the channel to grow and motivate me to add more videos.
Dinesh sir i think the programme time complexity is o(n^2) please reply sir
Nope !!!
@@itsdineshvaryani thanks for the nice reply sir
🙏🙏 Great explanation
Thank you sir for making this course for us
Welcome !!! Request you to please share it with ur friends and colleagues as well !!!
very nice explanations...your videos are superb...
Thanks !!!
can someone please explain about the time and space complexity of recursive vs iterative approach in this scenario? which one is better?
Do we have to think such logics on our own??...as it seems quite tricky when i was trying to made the logic before watching the video
Yes ... You hv to practice and make such concepts !!!
Thank you sir! Great explanation
Why is pop() method not used here, i believe poll() is generally used with a queue
its actually pop method ... sorry for typo ... watch its next video for proper code
@@itsdineshvaryani but using pop is giving empty stack exception
sir how you come up with such a difficult algorithm . How your mind works? Our mind will never be able think that deep
It comes with practice ...
Superb Explanation
Thanks
welcome !!! keep supporting !!!
Thank you so much sir💖
welcome !!!
Awesome sir 😋😋🤩
Thanks !!!
bro confusing! plz make easy video! another video of post order is for members only