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 - ua-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html
Your playlist is like energy drink, i need before my DSA interviews...helped me changeing job last year and i am sure will help me this year as well...thanks a lot bro for this wonderful playlist....👍👍
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over UA-cam with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)
Your videos are excellent source for new learners ! For this iterative Preorder traversal its using Stack DS. I see in some cases where Queue DS is used in Binary Tree traversal. I couldn't figure out when Stack is to be used and when Queue is to be used in Binary Tree. Do you have any video which is using Queue/Dqueue DS instead of Stack DS ? I want to understand the implementation using Queue/Dqueue DS. Thanks again for your excellent videos !
Sir I follow you a lot and I think I grasped most of the concepts by watching your content, One humble request to you is that Start dynammic programming content and I am sure that you will get lakhs of views
Recursion has simple code while performing tree traversals ... Both has same time and space complexities ... But its preferred to use iterative ... Bcoz it avoids stack to get overflow ...
if you understand the way stacks work, the way he explains it is clear enough. The root node is passed into the stack, but with the LIFO principle, the procedure shows how they are processed (iteratively)
@@itsdineshvaryani please upload videos on what topics to be prepared for a beginner google,amazon,microsoft internships.Thanks in advance your explanation is awesome
@@itsdineshvaryani thanks a lot sir, Can you please suggest me the topics to be go through perfectly for the internships? please, I am trying so hard to get
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 - ua-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html
Your playlist is like energy drink, i need before my DSA interviews...helped me changeing job last year and i am sure will help me this year as well...thanks a lot bro for this wonderful playlist....👍👍
Welcome
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over UA-cam with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)
Thanks !!!
Thanks a lot. The patients and efforts can be seen in the video. Great way of explaining!
Glad you liked the videos !!!
not seen such a crystal clear explanation.☺
Thanks !!!
Very well explained. Really appreciate your teaching skills.
Thanks !!!!
Your videos are excellent source for new learners !
For this iterative Preorder traversal its using Stack DS. I see in some cases where Queue DS is used in Binary Tree traversal. I couldn't figure out when Stack is to be used and when Queue is to be used in Binary Tree. Do you have any video which is using Queue/Dqueue DS instead of Stack DS ? I want to understand the implementation using Queue/Dqueue DS. Thanks again for your excellent videos !
Its there !!! In bfs we use queue and in dfs we use stack
Thanks for your answer !
Great tutorial for DSA in Java
Glad you liked it
Sir I follow you a lot and I think I grasped most of the concepts by watching your content, One humble request to you is that Start dynammic programming content and I am sure that you will get lakhs of views
Sure !!!
@@itsdineshvaryani if you have any paid content of dynamic programming please let me know specifically for competitive programming
@@TheSKooler will add ... Currently i dont have !!!
Thanks u so much for crystal clear explanation 👍👌
Welcome !!
what is the fundamental difference between recursive and iterative? Like, does iterative take lesser time? Can you explain?
Can you please tell me, Which one is recommended to use? Recursive Version OR Iterator Version?
Please give Replay to me, Thank you
Recursion has simple code while performing tree traversals ... Both has same time and space complexities ... But its preferred to use iterative ... Bcoz it avoids stack to get overflow ...
@@itsdineshvaryani humm ok, thank you so much for your reply 🧡
Thank you sir! Awesome algorithms.
Welcome
Thank you so much sir for ur effort 🙏
It's my pleasure
Those who can see invisible, can do impossible 👍👍👍👍👍
Thanks bro your content is clean an easy to understand nice 1 :)
welcome !!!
Thank you for uploading, very helpful!!!
Nitin Maheshwari Welcome !!!
Bro , please upload the post order , inorder iterative traversal.
Already uploaded
Excellent 🤜bro
Thank you! Cheers!
Sir dont we have to pass the TreeNode root into the method??
???
if you understand the way stacks work, the way he explains it is clear enough. The root node is passed into the stack, but with the LIFO principle, the procedure shows how they are processed (iteratively)
very nice Sir 😊😊
👌👌👍
thank you so much
Welcome !!!
@@itsdineshvaryani please upload videos on what topics to be prepared for a beginner google,amazon,microsoft internships.Thanks in advance your explanation is awesome
@@santhoshimalay2558 Am trying to post more and more. Hopefully will try to cover more interview questions as well !!!
@@itsdineshvaryani thanks a lot sir, Can you please suggest me the topics to be go through perfectly for the internships? please, I am trying so hard to get
Topics in data structures and algorithms ???
unable to download the source code..can u plz suggest how to download.
The source code github link has been added in description of video. Please check !!!
thankss
Welcome !!!
nice
12:36
Would doing this with a queue instead give you post-order traversal?
I dont think so ...