Solving LeetCode 257 in JavaScript (Binary Tree Paths)

In this video I solve LeetCode problem 257 (Binary Tree Paths) with the JavaScript programming language. This question has previously appeared during Amazon coding interviews.

I start by helping you understand what the problem is asking for, then I will go over the pseudo-code/logic for a solution, and finally I will write the solution code explaining each line, step-by-step.

Using my simple and easy-to-understand methodology, I make difficult and complex interview questions *incredibly* easy to understand. So easy in fact, that even your grandma could do it! 👵🏻

I will be solving a new problem EVERY WEEK, so be sure to smash that subscribe button and hit the notification bell so you don't miss a single one! 😀

-----
I also offer full-length interview preparation courses, programming tutorials, and even 1-1 tutoring!

Who knew acing your next software engineering interview could be *so* incredibly easy!

-----
#programming #codinginterview #leetcode

[lukelyu]

Is that left side of Binary Tree always smaller than right side? How come "2" in that position in the example?