isSameTree = function (p, q) {
    if (isSameNode(p, q)) return true;

    return bfs([[p, q]]);
}
https://leetcode.com/problems/same-tree/
TIme O(N) | Space O(W)
@param {TreeNode} p
@param {TreeNode} q
@return {boolean}