FunctionRacerProblemsRace

Find Bottom Left Tree Value

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the value of the leftmost node on the deepest level of the tree. The tree has at least one node.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [2,1,3]
returns 1

The deepest level is [1, 3]; its leftmost value is 1.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems