Simple Solution💯
Please consider upvoting if it is found useful\uD83E\uDEE1\n\n# Code\n\n/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n *
# Please consider upvoting if it is found useful\uD83E\uDEE1\n\n# Code\n```\n/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n *     this.val = (val===undefined ? 0 : val)\n *     this.left = (left===undefined ? null : left)\n *     this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @return {number}\n */\nvar findBottomLeftValue = function(root) {\n   \n   const queue=[root]\n   let leftmostVal;\n   \n    while(queue.length){\n\n        const node=queue.shift()\n        leftmostVal = node.val\n\n        if(node.right){\n            queue.push(node.right)\n        }\n        if(node.left){\n            queue.push(node.left)\n        }\n    \n    }\n    return leftmostVal;\n  \n};\n```
['JavaScript']