Practice Find Bottom Left Tree Value
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#513
LeetCode ProblemFind Bottom Left Tree Value
Problem Statement
Given the root of a binary tree, return the leftmost value in the last row of the tree.
Source: Find Bottom Left Tree Value on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [2,1,3]
Output
1
# Example 2
Input
root = [1,2,3,4,null,5,6,null,null,7]
Output
7
Constraints
The number of nodes in the tree is in the range [1, 10^4].
-2^31 <= Node.val <= 2^31 - 1
Related LeetCode Problems
Practice more problems similar to Find Bottom Left Tree Value.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.