Iterative Preorder traversal of a Binary Tree in Java

►Full DSA Course - • Data Structures and Al...
►Follow me on Instagram - bit.ly/intrvwk...
►Follow me on LinkedIn - bit.ly/fllwlkdn
►Enroll in the complete course: bit.ly/3W4qthg
►Source Code - github.com/din...
►Download DSA Animation Slides - techready.in/c...
►Click here to subscribe - www.youtube.co...
Watch all my playlist here:
►Data Structures and Algorithms Course playlist: • Data Structures and Al...
►Mastering JUnit 5 - www.youtube.co...
►Mastering Mockito 3 - • Mockito 3 Tutorials
►Analysis of Algorithms - • Analysis of Algorithms
►Linked List Data Structures - • Linked List Data Struc...
►Array Data Structures - • Playlist
►Stack Data Structure - • Stack Data Structure
►Queue Data Structure - • Queue Data Structure
►Binary Tree Data Structure - • Binary Tree Data Struc...
►Graph Data Structure - • Graph Data Structure
►Binary Heap Data Structure - • Binary Heap Data Struc...
►Trie Data Structure - • Trie Data Structure
►Dynamic Programming Algorithms - • Dynamic Programming Al...
►Hashing Data Structures - • Hashing Data Structures
►Sorting and Searching - • Sorting and Searching
►String Algorithms - • String Algorithms
Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.
The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -
1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.
The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...
#dsa #algorithms #coding

[@itsdineshvaryani]

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 - kzbin.info/aero/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d

[@shubhamagarwal1434]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over KZbin with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

[@itsdineshvaryani]

Thanks !!!

[@shubhamagarwal1434]

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....👍👍

[@itsdineshvaryani]

Welcome

[@shabnamjarial1302]

Thanks a lot. The patients and efforts can be seen in the video. Great way of explaining!

[@itsdineshvaryani]

Glad you liked the videos !!!

[@swapniltravels]

not seen such a crystal clear explanation.☺

[@itsdineshvaryani]

Thanks !!!

[@Kumarvivek-uv5hf]

Very well explained. Really appreciate your teaching skills.

[@itsdineshvaryani]

Thanks !!!!

[@rishabsud7535]

what is the fundamental difference between recursive and iterative? Like, does iterative take lesser time? Can you explain?

[@TheSKooler]

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

[@itsdineshvaryani]

Sure !!!

[@TheSKooler]

@@itsdineshvaryani if you have any paid content of dynamic programming please let me know specifically for competitive programming

[@itsdineshvaryani]

@@TheSKooler will add ... Currently i dont have !!!

[@randipmalakar554]

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 !

[@itsdineshvaryani]

Its there !!! In bfs we use queue and in dfs we use stack

[@randipmalakar554]

Thanks for your answer !

[@barathkumar873]

Thanks u so much for crystal clear explanation 👍👌

[@itsdineshvaryani]

Welcome !!

[@orusuvenkatesh9090]

Great tutorial for DSA in Java

[@itsdineshvaryani]

Glad you liked it

[@ascar66]

Thank you sir! Awesome algorithms.

[@itsdineshvaryani]

Welcome

[@rahulrsavant]

Those who can see invisible, can do impossible 👍👍👍👍👍

[@DSCS_AkshataChavan]

Thank you so much sir for ur effort 🙏

[@itsdineshvaryani]

It's my pleasure

[@srikanthracharla420]

Can you please tell me, Which one is recommended to use? Recursive Version OR Iterator Version? Please give Replay to me, Thank you

[@itsdineshvaryani]

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 ...

[@srikanthracharla420]

@@itsdineshvaryani humm ok, thank you so much for your reply 🧡

[@kasicoodes8730]

Thanks bro your content is clean an easy to understand nice 1 :)

[@itsdineshvaryani]

welcome !!!

[@ranjankashyap1866]

Sir dont we have to pass the TreeNode root into the method??

[@itsdineshvaryani]

???

[@_SeaH0rse]

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)

[@nitinmaheshwari9272]

Thank you for uploading, very helpful!!!

[@itsdineshvaryani]

Nitin Maheshwari Welcome !!!

[@sanjayjitu1]

Bro , please upload the post order , inorder iterative traversal.

[@itsdineshvaryani]

Already uploaded

[@janimiyashaik1411]

Excellent 🤜bro

[@itsdineshvaryani]

Thank you! Cheers!

[@abhishekranjan1094]

very nice Sir 😊😊

[@pratyushranjansahu9495]

unable to download the source code..can u plz suggest how to download.

[@itsdineshvaryani]

The source code github link has been added in description of video. Please check !!!

[@ekansh6267]

👌👌👍

[@santhoshimalay2558]

thank you so much

[@itsdineshvaryani]

Welcome !!!

[@santhoshimalay2558]

@@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]

@@santhoshimalay2558 Am trying to post more and more. Hopefully will try to cover more interview questions as well !!!

[@santhoshimalay2558]

@@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

[@itsdineshvaryani]

Topics in data structures and algorithms ???

[@jaspalsingh-mv5xh]

nice

[@parultak2218]

thankss

[@itsdineshvaryani]

Welcome !!!

[@saquelainmokhtar6016]

12:36

[@nicoqueijo]

Would doing this with a queue instead give you post-order traversal?

[@itsdineshvaryani]

I dont think so ...