Function bfs

javascript/0100-same-tree.js:56–69

(queue)

};

const bfs = (queue) => {
    while (queue.length) {
        for (let i = queue.length - 1; 0 <= i; i--) {
            const [p, q] = queue.shift();

            if (!isSame(p, q)) return false;

            if (p.left) queue.push([p.left, q.left]);
            if (p.right) queue.push([p.right, q.right]);
        }
    }

    return true;
};

const isSameNode = (p, q) => {
    const isBaseCase = !(p || q);