Function dfs

javascript/0100-same-tree.js:36–41

(p, q)

 * @returns 
 */
const dfs = (p, q) => {
    const left = isSameTree(p.left, q.left);
    const right = isSameTree(p.right, q.right);

    return left && right;
};

/**
 * https://leetcode.com/problems/same-tree/