invertTree = (root,) => {
    const isBaseCase = root === null;
    if (isBaseCase) return root;

    bfs([ root ]);

    return root;
}
https://leetcode.com/problems/invert-binary-tree/
TIme O(N) | Space O(W)
@param {TreeNode} root
@return {TreeNode}