Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

freeCodeCamp

Binary Tree Algorithms for Technical Interviews - Full Course

via freeCodeCamp

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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.

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

Reviews

5.0 rating, based on 1 Class Central review

Start your review of Binary Tree Algorithms for Technical Interviews - Full Course

  • Profile image for Joel Nitin
    Joel Nitin
    The course on Binary Trees was highly informative and well-structured. It clearly explained fundamental concepts such as nodes, traversal techniques (inorder, preorder, postorder), and types of binary trees like BSTs and AVL trees. The instructor…

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.