Leetcode•May 22, 2025
Find Bottom Left Tree Value
Hazrat Ali
Leetcode
Given the root of a binary tree, return the leftmost value in the last row of the tree.
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
Solution
/**
* @param {TreeNode} root
* @return {number}
*/
const findBottomLeftValue = root => {
const queue = [root];
while (queue.length) {
root = queue.shift();
if (root.right != null) {
queue.push(root.right);
}
if (root.left != null) {
queue.push(root.left);
}
}
return root.val;
};