Binary tree traversal: Preorder, Inorder, Postorder

See complete series on data structures here:

In this lesson, we have described Preorder, Inorder and Postorder algorithms for binary tree traversal and analyzed their time and space complexities.

See source code here:

For more on time complexity analysis:

[FabianLopez_lomba]

I've lost track of how many times this chanel has saved me. Great job!

[Tommy-yqvr]

100 times more clearer than those overly complicated computer science books that look like a robot had written them.

[CSERISHINANDHA]

If you noticed, in every single video where he assumes some random addresses for nodes, the minimum difference between the address of any two nodes will not be lesser than 2x(number of bytes occupied by the node in a 64 byte operating system). Meaning, he always stays alert in what he's doing. Respect+💂

[sarkarpiu]

After studying it almost everywhere else around a million times, this video finally helped me understand the pre, post and inorder traversal of trees. Thank you so much for making it so easy to understand. I think every computer science student needs to watch this video.

[fsandovc]

I have to say this is one of the most clearer explanation I have found on Youtube, everyone explains the ROOT/LEFT/RIGHT and the code part. But the majority don't explain how the memory is managing the nodes data and how it returns it back. Thanks a lot!

[unknownguywholovespizza]

This channel is pure gold 🥇. Everything is just clear without someone showing off instead of teaching. 😀

[kevin-kuei]

Just wanted to say I really appreciate these algorithm videos. Great explanations, diagraming, and delivery all around. Looking forward to exploring more of your content.

[jacquelinelee]

One of the most talented tutors I've ever seen on Youtube!!!! You Rock!

[mudassirshahzadkk]

6 years old but still much better than other latest videos on this topic.

[adityaojha]

Nothing can be better than these playlists.

[pareshb]

MycodeSchool: "We are reducing this problem in a self similar manner"

Me: "Oh shit! Recursion is coming😭"

[fmacoful]

You save my life from Christmas homework.
You are the hero.
You are hope of humankind!!!

[md-ayaz]

I owe you a lot brother. You should continue making videos.

[veritas]

The most clear explanations of all youtube, thank you!

[mehershrishtinigam]

I will never forget any of the tree concepts now. Thank you.

[hangchen]

Awesome walkthrough of the recursive function of the traversal of a binary tree in detail with a stack structure illustrated! I now fully understand the magic behind the code! Your videos are the best data structure tutorials I can find so far! Thanks :)

[wastingtime]

Explained really well! Still helping someone 5 years after the video was made now that's quality this is timeless.

[erics]

This was very helpful. I was getting a bit confused on how exactly the recursive code was behaving in relation to the tree and your side by side approach really cleared it up for me. Great job, thank you!

[armadonluvr]

Studying for my midterm, and this is one of the topics tomorrow. Can not thank you enough for a clear, concise, well drawn, and well thought out explanation. Thanks dude

[bvwalker]

Nice presentation! Just an FYI, you have the Inorder output listed incorrectly (around 12:35 mark). You added an "H" by mistake making 11 pieces of data instead of 10.