Function bfs

javascript/0199-binary-tree-right-side-view.js:14–31

(queue, rightSide = [])

};

const bfs = (queue, rightSide = []) => {
    while (queue.length) {
        let prev = null;

        for (let i = queue.length - 1; 0 <= i; i--) {
            const node = queue.shift();

            prev = node;

            if (node.left) queue.push(node.left);
            if (node.right) queue.push(node.right);
        }

        rightSide.push(prev.val);
    }

    return rightSide;
};

/**
 * https://leetcode.com/problems/binary-tree-right-side-view/