The Binary Tree Algorithms Crash Course in Python

Learn the essential binary tree traversal algorithms and solve common interview problems.
Rating: 4.8 out of 5 (3 ratings)
597 students
1hr 47min of on-demand video
English [Auto]

Solve common technical interview problems that deal with binary tree data structures
Implement the essential binary tree traversal algorithms in Python
Visualize the mechanics of binary tree algorithms
Analyze the Big-O time and space complexity of binary tree algorithms


  • This course assumes basic knowledge of the Python programming language. Students should be familiar with variables, if statements, loops, and functions.


Welcome to the Binary Tree Algorithms Crash Course in Python. This mini-course is designed to give you the background and tools you need to start solving Binary Tree interview problems. We'll give you all the essential knowledge you need in less than three hours. This course is designed especially for beginners, so you don't need to know any data structures and algorithms to get started.

This crash course is a great fit for you if:

  • you are a beginner to data structures and algorithms

  • you need a structured system to learn about binary trees in a short amount of time

  • you don't like wasting your time drilling random, disconnected leetcode problems

  • you want to build a robust visual and mental understanding of algorithms

  • you want to be taught by a former Google engineer with years of professional teaching experience

The course features video explanations for every piece of curriculum. This includes conceptual video animations and Python implementation walkthroughs for every problem. We will start simple and progress to more complex problems to ensure that you understand every step of the way.

During the course we'll learn how to:

  • master the two essential algorithms that serve as the backbone to virtually every Binary Tree problem

  • apply these algorithms to solve common technical interview problems

  • visualize the thought-process behind each problem

  • analyze the Big-O time and space complexity of solutions

This course is the most efficient way to learn about Binary Tree algorithms.

Who this course is for:

  • Python programmers who are preparing for technical interviews in data structures and algorithms.


Software Engineering Instructor
Alvin Zablan
  • 4.8 Instructor Rating
  • 3 Reviews
  • 597 Students
  • 1 Course

Hey Programmers! I'm Alvin. I'm a software engineer with a serious passion for teaching. I'm a former Google Software Engineer. I'm also a former Lead Curriculum Developer of App Academy, a top coding bootcamp. I'm a Featured Instructor on the freeCodeCamp youtube channel, where my lectures have accumulated over 6 million views. I have spent the better part of the last decade teaching students the skills needed to be a great developer and land their dream job.

Through years of experience leading in the classroom, working with students one-on-one, and in front of the video camera, I've developed a teaching style that I'm excited to share with you. I believe that gradual progression is the key to building robust and durable knowledge that you'll be able to apply in your interviews and on the job. We'll go slow so that you don't miss a step. With my system, you'll enter the course as a beginner, but leave with the skills to build and succeed.

Let's learn together.

Top companies trust Udemy

Get your team access to Udemy's top 25,000+ courses