Binary Tree Algorithms for Technical Interviews – Full Course

Ecommerce Empire Academy

Learn how to implement binary tree algorithms and how to use them to solve coding challenges. 🌳

✏️ This course was developed by Alvin Zablan from Structy. Check out Alvin's channel:

🔗 Learn data structures and algorithms:

⭐️ Course Contents ⭐️
⌨️ (0:00:00) Course Introduction
⌨️ (0:01:09) What is a Binary Tree?
⌨️ (0:11:28) Binary Tree Node Class
⌨️ (0:14:19) Depth First Values – ( )
⌨️ (0:36:00) Breadth First Values – ( )
⌨️ (0:47:43) Tree Includes – ( )
⌨️ (1:05:35) Tree Sum – ( )
⌨️ (1:19:53) Tree Min Value – ( )
⌨️ (1:34:16) Max Root to Leaf Path Sum – ( )
⌨️ (1:48:28) Conclusion

🎉 Thanks to our Champion and Sponsor supporters:
👾 Wong Voon jinq
👾 hexploitation
👾 Katia Moran
👾 BlckPhantom
👾 Nick Raker
👾 Otis Morgan
👾 DeezMaster
👾 AppWrite

Learn to code for free and get a developer job:

Read hundreds of articles on programming:

And subscribe for new videos on technology every day:

27 thoughts on “Binary Tree Algorithms for Technical Interviews – Full Course”

  1. Alvin the Programmer

    Hey Programmers! Thanks for watching. Head to Structy for more data structure and algorithm tutorials from me. Link available in the description. There you’ll find animated explanations and video walkthroughs for data structures and algorithms in JavaScript, Python, and C++.

    1. Hi Alvin! Great video, but I was wondering why you’re using a stack to create the tree functions instead of just using a Binary Tree class?

    2. @Alvin the Progammer, your website structy doesn’t have introductory videos to the different data structures, you just dive in straight to solving the problems. Why is that the case?

  2. For the last problem, you could consider the null nodes as your base case but return 0 rather than negative infinity. In that way they would not contribute to the path sum, and you won’t have to add leaf nodes in your base case as both paths would return your current node value + 0.
    However, this only works knowing that the node values are positive.

  3. This guy is the best! I just wanted to brush up on this topic and stumbled upon this precious lecture. Now I want to watch all his lessons 🤓👍

  4. Shaunak Galvankar

    Amazing videos alvin,got the clarity of thought needed for solving problems recursively and also dynamic programming doesn’t seem a giant anymore

  5. Thank You a lot Alvin for the great Course. Definitively Structy is the best place to prepare efficiently for interviews.

  6. I love your videos, super clear and intuitive! Thank you! Also love Structy!
    But in this video, there’s a small mistake during the explanation of Depth first values. Around 32:26, the leftValues should be [‘b’, ‘d’] and the rightValues should be [‘e’, ‘c’, ‘f’]. Of course the final result will be the same. Nothing wrong with the code.
    Can’t wait for more of your algorithm videos! <3

  7. This was a great video and very well organized. I finished watching the whole video while coding the problems on Visual Studio Code in Python and now feel I have a good grasp of BFS, DFS, especially using recursion which I struggled with before. Thank you Alvin!

  8. Pankaj Chaurasia

    Thank you so much for all the efforts that you put through in getting this knowledge out for free. !

  9. Covered this video in one night 😀
    Amazing by the speed and quality of teaching from Alvin.
    Really helpful stuff, and recommend Alvin for getting prepared for DS&A.

  10. I love that he goes over all the common mistakes people often make on the first try! It’s very normalizing to see him show those mistakes, makes me feel much better lol, and also the explanations of those mistakes dig deeper and improve our understanding.

  11. SIOMARA CINTIA Pantarotto

    Fantastic! I learned a lot with this tutorial. Thanks for sharing your knowledge with us. God bless you forever! ❤💯❤

  12. Pramod Kumar

    Thank you so much. It really helped me to understand the tree traversal in detail. Thanks again! I understood the DFS and BFS for the first time. Use of Queue and Stack for them is the key to understand the whole.

  13. Ignacio Leikis

    Awesome course! Is there a way to print combinations / permutations using these binary trees?
    Is it also possible to construct composite trees (trees with nodes with more than two children)?
    Thank you!

  14. IllogicalStuff

    I am still trying to figure out, how is he able to understand recursion so well, explain it so well, and master it so well. 🥺

  15. Great video on Binary Trees. I was struggling to solve basic problems in Binary Trees and then i finally stumbled upon this video. The way Alvin walks through the course really drills down the concept in your head and makes you feel so comfortable ! Amazing 💯

  16. This is an excellent video, when I sat down and really watched this thoroughly after practicing a bunch of binary tree algos, this helped to solidify even more concepts. <3

Comments are closed.