# Binary Tree Algorithms for Technical Interviews – Full Course

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: https://www.youtube.com/c/AlvinTheProgrammer 🔗 Learn data structures and algorithms: https://structy.net/ ⭐️ 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 – (https://structy.net/problems/depth-first-values)
⌨️ (0:47:43) Tree Includes – (https://structy.net/problems/tree-includes)
⌨️ (1:05:35) Tree Sum – (https://structy.net/problems/tree-sum)
⌨️ (1:19:53) Tree Min Value – (https://structy.net/problems/tree-min-value)
⌨️ (1:34:16) Max Root to Leaf Path Sum – (https://structy.net/problems/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: https://www.freecodecamp.org Read hundreds of articles on programming: https://freecodecamp.org/news And subscribe for new videos on technology every day: https://youtube.com/subscription_center?add_user=freecodecamp

Binary Tree Algorithms for Technical Interviews – Full Course