Time: 70 ms (28.65%) | Memory: 53 MB (58.48%) - LeetSync

513-find-bottom-left-tree-value/find-bottom-left-tree-value.js

@@ -0,0 +1,32 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var findBottomLeftValue = function(root) {
+
+    const queue = [root];
+    let leftmostValue;
+
+    while (queue.length > 0) {
+        const node = queue.shift();
+
+        leftmostValue = node.val;
+
+        if (node.right) {
+            queue.push(node.right);
+        }
+        if (node.left) {
+            queue.push(node.left);
+        }
+    }
+
+    return leftmostValue;
+};