Dive into a comprehensive video course on implementing binary tree algorithms for technical interviews. Master the fundamentals of binary trees, including depth-first and breadth-first traversals, and learn to solve coding challenges involving tree includes, tree sum, minimum value, and maximum root-to-leaf path sum. Gain practical skills through hands-on coding exercises and explanations from experienced instructor Alvin Zablan. Enhance your problem-solving abilities and prepare for technical interviews with this in-depth exploration of binary tree algorithms.
Overview
Syllabus
) Course Introduction.
) What is a Binary Tree?.
) Binary Tree Node Class.
) Depth First Values - (https://structy.net/problems/depth-first-values).
) Breadth First Values - (https://structy.net/problems/breadth-first-values).
) Tree Includes - (https://structy.net/problems/tree-includes).
) Tree Sum - (https://structy.net/problems/tree-sum).
) Tree Min Value - (https://structy.net/problems/tree-min-value).
) Max Root to Leaf Path Sum - (https://structy.net/problems/max-root-to-leaf-path-sum).
) Conclusion.
Taught by
freeCodeCamp.org
Related Courses
-
Graph Algorithms for Technical Interviews - Full Course
-
Getting Deep into Complex Algorithms for Interviews with JS
-
Getting Deep into Complex Algorithms for Interviews with Python
-
Getting Deep into Complex Algorithms for Interviews with Java
-
Data Structures and Algorithms in Python - Full Course for Beginners
4.6 -
Algorithms Course - Graph Theory Tutorial from a Google Engineer
