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

Binary Tree Algorithms for Technical Interviews - Full Course

via freeCodeCamp

Start learning Write review

Details

Start learning

Provider

freeCodeCamp
Pricing

Free Video
Languages

English
Effort

1-2 hours
Sessions

Self-Paced
Level

Intermediate

Found in

Binary Tree Courses

A full course on binary tree algorithms commonly asked in technical interviews, starting from what a binary tree is and a node class implementation. It then works through problems including depth-first and breadth-first values, tree includes, tree sum, tree min value, and max root-to-leaf path sum.

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

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…

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 provided clear examples and visual explanations that made complex topics easy to understand. Practical coding exercises strengthened problem-solving skills and deepened understanding of tree operations like insertion, deletion, and searching. The course balanced theory and implementation effectively, making it suitable for both beginners and intermediate learners. Overall, it was an excellent learning experience that improved my understanding of data structures and algorithmic thinking.