513. Find Bottom Left Tree Value
Medium
Given the root
of a binary tree, return the leftmost value in the last row of the tree.
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[1, 10^4]
.-2^31 <= Node.val <= 2^31 - 1
解ι‘
Runtime: 0 ms, faster than 100%
Memory Usage: 5.1 MB, less than 100%
Last updated