Learn the essential binary tree traversal algorithms and solve common interview problems.
Note: Course Free for limited time and limited users(500 limit) so Enroll ASAP. If not free it means you are late. Scroll Down and click Enroll Now button to get enrolled
What You will Learn
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
Scroll Down and click Enroll Now Button to get enrolled into the Free Course
Requirements
- This course assumes basic knowledge of the Python programming language. Students should be familiar with variables, if statements, loops, and functions.
Description
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.
Show less
Course content
3 sections • 17 lectures • 1h 46m total lengthCollapse all sections
Course Introduction1 lecture • 2min
- Welcome to the Binary Tree Crash Course02:21
Binary Tree Basics6 lectures • 47min
- Intro to Binary Trees10:20
- Basic Python Implementation03:09
- Depth First Traversal Explained06:36
- Depth First Traversal Python Implementation13:16
- Breadth First Traversal Explained05:57
- Breadth First Traversal Python Implementation08:01
Common Binary Tree Interview Problems10 lectures • 57min
- Tree Sum Explained06:39
- Tree Sum Python Implementation05:25
- Intermission00:34
- Tree Includes Explained09:14
- Tree Includes Python Implementation08:23
- Tree Min Value Explained05:40
- Tree Min Value Python Implementation06:41
- Max Path Sum Explained08:52
- Max Path Sum Python Implementation05:00
- Course Conclusion00:24
Note: Course Free for limited time and limited users(500 limit) so Enroll ASAP. If not free it means you are late.
