Binary Tree Algorithms for Technical Interviews - Full Course

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

⭐️ Course Contents ⭐️
⌨️ (0:00:00) Course Introduction
⌨️ (0:01:09) What is a Binary Tree?
⌨️ (0:11:28) Binary Tree Node Class
⌨️ (1:48:28) Conclusion

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

--

[davitkvaratskhelia]

I just watched day before to my interview and I was called today to be hired. Going to donate full of my first salary.

[deniskhakimov]

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

[Secretzstolen]

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.

[IldarSagdejev]

The recursive depth-first traversal is essentially the same as the solution using a stack, it's just that you're using the call stack as the stack for the algorithm.

[piglovesasy]

NOT confusing explanation, soothing and clear voice, so glad I found you! great work! thanks Alvin

[soulju]

Alvin was born to teach anything coding related I'm certain. Got introduced to him while going through app academy and everytime i see a video of his I'll watch it several times over. Ofc I try to make an independent attempt at understanding but the amount of clarity that comes from him is amazing. Thank you

[gagag]

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!

[shaunakgalvankar]

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

[muktarsayeed]

I like the way you broke down the recursion problems into base cases and general cases and tackled each one independently then combined it for the final solution. I think my issue was I tried to solve it in one go which led to me getting stuck. The recursive problems can be a real head wrecker if you're not careful!!

[diniaadil]

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.

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

[mvqixwx]

it is incredible the way that you explain these challenging concepts with ease. I also watched your DP video and its amazing. Keep it going with the content

[BlueHat]

This teach is the best! He really helps us visualize those abstract topics so well, which I'm sure helps a lot of people. Thank you!

[hmmm-tsrb]

no way!!!! literally found his vids on dp and graphs last week, watching this asap.

[phen]

What a great course! For anyone wondering, I was able to follow along in Python despite the code being in JS with minimal issues! Would recommend

[CodewithRSV]

These are some premium quality tutorials.

[VitaminBeast]

Wow, this even helped me in my lumberjack career

[benhardsim]

Alvin is my favorite tutor in free code camp, i always watch the video he make no matter what is it about. His video about dynamic programming and graph theory is really good, you guys should check it out. 👍

[khaino]

This guy is the best data structure and algorithm instructor I have known so far….

[benzz]

alvin is the best instructor on this channel. his voice and explanations are clear, and the animations help so much. thank you for this free education