Find Bottom Left Tree Value LeetCode solution in JavaScript

1
var findBottomLeftValue = function (root) {
2
  let arr = [];
3
  let q = [root];
4
  while (q.length !== 0) {
5
    let current = q.shift();
6
    arr.push(current.val);
7
    if (current.right) {
8
      q.push(current.right);
9
    }
10
    if (current.left) {
11
      q.push(current.left);
12
    }
13
  }
14
  return arr[arr.length - 1];
15
};