rightSideView = function(root) {
    const isBaseCase = root === null;
    if (isBaseCase) return [];

    return bfs([ root ]);
}
https://leetcode.com/problems/binary-tree-right-side-view/
Time O(N) | Space O(W)
@param {TreeNode} root
@return {number[]}